./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:13:57,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:13:57,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:13:57,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:13:57,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:13:57,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:13:57,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:13:57,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:13:57,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:13:57,823 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:13:57,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:13:57,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:13:57,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:13:57,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:13:57,825 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:13:57,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:13:57,826 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:13:57,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:13:57,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:13:57,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:13:57,827 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:13:57,828 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:13:57,828 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:13:57,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:13:57,831 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:13:57,831 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:13:57,832 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:13:57,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:13:57,832 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:13:57,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:13:57,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:13:57,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:13:57,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:13:57,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:13:57,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:13:57,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:13:57,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:13:57,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:13:57,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:13:57,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:13:57,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:13:57,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:13:57,840 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-clean/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-clean/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 -> 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 [2024-10-11 19:13:58,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:13:58,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:13:58,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:13:58,116 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:13:58,116 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:13:58,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2024-10-11 19:13:59,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:13:59,939 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:13:59,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2024-10-11 19:13:59,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a4c57f67e/be413fe20f474ddf8fa8b23bf7a177fc/FLAG8a361e34b [2024-10-11 19:14:00,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a4c57f67e/be413fe20f474ddf8fa8b23bf7a177fc [2024-10-11 19:14:00,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:14:00,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:14:00,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:14:00,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:14:00,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:14:00,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:14:00" (1/1) ... [2024-10-11 19:14:00,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b79f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:00, skipping insertion in model container [2024-10-11 19:14:00,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:14:00" (1/1) ... [2024-10-11 19:14:00,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:14:00,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:14:01,003 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-11 19:14:01,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@185be25e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:01, skipping insertion in model container [2024-10-11 19:14:01,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:14:01,004 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:14:01,006 INFO L158 Benchmark]: Toolchain (without parser) took 759.17ms. Allocated memory is still 190.8MB. Free memory was 132.4MB in the beginning and 153.4MB in the end (delta: -21.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 19:14:01,007 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:14:01,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 755.18ms. Allocated memory is still 190.8MB. Free memory was 132.0MB in the beginning and 153.4MB in the end (delta: -21.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 19:14:01,009 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 755.18ms. Allocated memory is still 190.8MB. Free memory was 132.0MB in the beginning and 153.4MB in the end (delta: -21.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:14:03,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:14:03,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:14:03,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:14:03,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:14:03,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:14:03,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:14:03,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:14:03,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:14:03,140 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:14:03,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:14:03,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:14:03,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:14:03,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:14:03,142 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:14:03,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:14:03,146 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:14:03,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:14:03,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:14:03,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:14:03,146 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:14:03,148 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:14:03,148 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:14:03,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:14:03,149 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:14:03,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:14:03,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:14:03,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:14:03,150 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:14:03,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:14:03,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:14:03,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:14:03,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:14:03,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:14:03,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:14:03,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:14:03,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:14:03,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:14:03,153 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:14:03,153 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:14:03,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:14:03,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:14:03,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:14:03,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:14:03,154 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:14:03,154 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-clean/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-clean/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 -> 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 [2024-10-11 19:14:03,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:14:03,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:14:03,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:14:03,531 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:14:03,531 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:14:03,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2024-10-11 19:14:05,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:14:05,339 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:14:05,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2024-10-11 19:14:05,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e024b70ce/0bcbf4b0754041a0ab92b3deee44a197/FLAGc7396f72f [2024-10-11 19:14:05,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e024b70ce/0bcbf4b0754041a0ab92b3deee44a197 [2024-10-11 19:14:05,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:14:05,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:14:05,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:14:05,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:14:05,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:14:05,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:14:05" (1/1) ... [2024-10-11 19:14:05,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574bf65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:05, skipping insertion in model container [2024-10-11 19:14:05,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:14:05" (1/1) ... [2024-10-11 19:14:05,452 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:14:06,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:14:06,069 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:14:06,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:14:06,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:14:06,174 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:14:06,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:14:06,332 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:14:06,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:06 WrapperNode [2024-10-11 19:14:06,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:14:06,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:14:06,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:14:06,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:14:06,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:06" (1/1) ... [2024-10-11 19:14:06,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:06" (1/1) ... [2024-10-11 19:14:06,465 INFO L138 Inliner]: procedures = 179, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1184 [2024-10-11 19:14:06,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:14:06,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:14:06,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:14:06,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:14:06,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:06" (1/1) ... [2024-10-11 19:14:06,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:06" (1/1) ... [2024-10-11 19:14:06,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:06" (1/1) ... [2024-10-11 19:14:06,591 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-10-11 19:14:06,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:06" (1/1) ... [2024-10-11 19:14:06,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:06" (1/1) ... [2024-10-11 19:14:06,658 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:06" (1/1) ... [2024-10-11 19:14:06,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:06" (1/1) ... [2024-10-11 19:14:06,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:06" (1/1) ... [2024-10-11 19:14:06,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:06" (1/1) ... [2024-10-11 19:14:06,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:14:06,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:14:06,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:14:06,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:14:06,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:06" (1/1) ... [2024-10-11 19:14:06,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:14:06,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:14:06,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:14:06,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:14:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:14:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:14:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:14:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:14:06,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 19:14:06,801 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 19:14:06,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:14:06,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:14:06,801 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:14:06,802 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:14:06,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:14:06,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:14:06,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:14:06,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:14:06,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:14:06,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:14:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:14:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:14:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:14:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:14:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:14:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:14:06,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:14:07,070 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:14:07,072 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:14:07,076 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:14:07,137 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:14:11,521 INFO L? ?]: Removed 1324 outVars from TransFormulas that were not future-live. [2024-10-11 19:14:11,521 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:14:11,700 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:14:11,701 INFO L314 CfgBuilder]: Removed 60 assume(true) statements. [2024-10-11 19:14:11,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:14:11 BoogieIcfgContainer [2024-10-11 19:14:11,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:14:11,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:14:11,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:14:11,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:14:11,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:14:05" (1/3) ... [2024-10-11 19:14:11,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3632f70a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:14:11, skipping insertion in model container [2024-10-11 19:14:11,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:06" (2/3) ... [2024-10-11 19:14:11,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3632f70a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:14:11, skipping insertion in model container [2024-10-11 19:14:11,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:14:11" (3/3) ... [2024-10-11 19:14:11,713 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-1.i [2024-10-11 19:14:11,729 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:14:11,730 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-10-11 19:14:11,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:14:11,817 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;@4e9837ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:14:11,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-10-11 19:14:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 1129 states, 488 states have (on average 2.5368852459016393) internal successors, (1238), 1120 states have internal predecessors, (1238), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:14:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 19:14:11,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:11,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 19:14:11,832 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:11,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:11,839 INFO L85 PathProgramCache]: Analyzing trace with hash 60265369, now seen corresponding path program 1 times [2024-10-11 19:14:11,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:11,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156994048] [2024-10-11 19:14:11,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:14:11,851 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-11 19:14:11,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:11,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:11,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:14:12,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:14:12,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:12,057 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-11 19:14:12,072 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-11 19:14:12,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:14:12,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:12,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156994048] [2024-10-11 19:14:12,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156994048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:14:12,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:14:12,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:14:12,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201995513] [2024-10-11 19:14:12,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:14:12,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:14:12,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:12,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:14:12,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:14:12,139 INFO L87 Difference]: Start difference. First operand has 1129 states, 488 states have (on average 2.5368852459016393) internal successors, (1238), 1120 states have internal predecessors, (1238), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:14:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:14,110 INFO L93 Difference]: Finished difference Result 1018 states and 1091 transitions. [2024-10-11 19:14:14,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:14:14,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 19:14:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:14,141 INFO L225 Difference]: With dead ends: 1018 [2024-10-11 19:14:14,144 INFO L226 Difference]: Without dead ends: 1017 [2024-10-11 19:14:14,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:14:14,151 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 926 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:14,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 485 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 19:14:14,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2024-10-11 19:14:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1015. [2024-10-11 19:14:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 479 states have (on average 2.2025052192066807) internal successors, (1055), 1006 states have internal predecessors, (1055), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:14:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1087 transitions. [2024-10-11 19:14:14,265 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1087 transitions. Word has length 4 [2024-10-11 19:14:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:14,266 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1087 transitions. [2024-10-11 19:14:14,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:14:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1087 transitions. [2024-10-11 19:14:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 19:14:14,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:14,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 19:14:14,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 19:14:14,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:14,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:14,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:14,471 INFO L85 PathProgramCache]: Analyzing trace with hash 60265370, now seen corresponding path program 1 times [2024-10-11 19:14:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:14,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100061664] [2024-10-11 19:14:14,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:14:14,472 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-11 19:14:14,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:14,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:14,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:14:14,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:14:14,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:14,633 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-11 19:14:14,648 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-11 19:14:14,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:14:14,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100061664] [2024-10-11 19:14:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100061664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:14:14,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:14:14,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:14:14,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566123227] [2024-10-11 19:14:14,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:14:14,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:14:14,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:14,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:14:14,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:14:14,652 INFO L87 Difference]: Start difference. First operand 1015 states and 1087 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:14:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:16,765 INFO L93 Difference]: Finished difference Result 1295 states and 1387 transitions. [2024-10-11 19:14:16,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:14:16,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 19:14:16,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:16,771 INFO L225 Difference]: With dead ends: 1295 [2024-10-11 19:14:16,771 INFO L226 Difference]: Without dead ends: 1295 [2024-10-11 19:14:16,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:14:16,772 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 464 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:16,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1165 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 19:14:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-10-11 19:14:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1144. [2024-10-11 19:14:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 618 states have (on average 2.163430420711974) internal successors, (1337), 1135 states have internal predecessors, (1337), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:14:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1369 transitions. [2024-10-11 19:14:16,799 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1369 transitions. Word has length 4 [2024-10-11 19:14:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:16,799 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1369 transitions. [2024-10-11 19:14:16,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:14:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1369 transitions. [2024-10-11 19:14:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 19:14:16,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:16,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 19:14:16,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:17,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:17,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:17,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:17,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1869885938, now seen corresponding path program 1 times [2024-10-11 19:14:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108467712] [2024-10-11 19:14:17,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:14:17,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:14:17,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:17,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:17,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:14:17,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:14:17,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:17,114 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-11 19:14:17,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:14:17,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:17,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108467712] [2024-10-11 19:14:17,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108467712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:14:17,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:14:17,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:14:17,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990157053] [2024-10-11 19:14:17,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:14:17,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:14:17,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:17,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:14:17,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:14:17,119 INFO L87 Difference]: Start difference. First operand 1144 states and 1369 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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-11 19:14:18,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:18,222 INFO L93 Difference]: Finished difference Result 2244 states and 2674 transitions. [2024-10-11 19:14:18,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:14:18,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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-11 19:14:18,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:18,231 INFO L225 Difference]: With dead ends: 2244 [2024-10-11 19:14:18,232 INFO L226 Difference]: Without dead ends: 2244 [2024-10-11 19:14:18,232 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-11 19:14:18,233 INFO L432 NwaCegarLoop]: 992 mSDtfsCounter, 1000 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:18,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 1945 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:14:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2024-10-11 19:14:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 1145. [2024-10-11 19:14:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 619 states have (on average 2.161550888529887) internal successors, (1338), 1136 states have internal predecessors, (1338), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:14:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1370 transitions. [2024-10-11 19:14:18,263 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1370 transitions. Word has length 5 [2024-10-11 19:14:18,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:18,264 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1370 transitions. [2024-10-11 19:14:18,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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-11 19:14:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1370 transitions. [2024-10-11 19:14:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 19:14:18,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:18,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:18,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 19:14:18,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:18,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:18,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:18,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1771353053, now seen corresponding path program 1 times [2024-10-11 19:14:18,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:18,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465680920] [2024-10-11 19:14:18,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:14:18,469 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-11 19:14:18,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:18,474 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:18,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:14:18,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:14:18,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:18,622 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-11 19:14:18,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:14:18,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:18,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465680920] [2024-10-11 19:14:18,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465680920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:14:18,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:14:18,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:14:18,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79187187] [2024-10-11 19:14:18,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:14:18,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:14:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:18,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:14:18,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:14:18,627 INFO L87 Difference]: Start difference. First operand 1145 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:14:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:19,416 INFO L93 Difference]: Finished difference Result 1106 states and 1330 transitions. [2024-10-11 19:14:19,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:14:19,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 19:14:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:19,423 INFO L225 Difference]: With dead ends: 1106 [2024-10-11 19:14:19,424 INFO L226 Difference]: Without dead ends: 1106 [2024-10-11 19:14:19,424 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-11 19:14:19,426 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 61 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:19,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1774 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:14:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2024-10-11 19:14:19,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2024-10-11 19:14:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 604 states have (on average 2.1490066225165565) internal successors, (1298), 1097 states have internal predecessors, (1298), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:14:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1330 transitions. [2024-10-11 19:14:19,457 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1330 transitions. Word has length 10 [2024-10-11 19:14:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:19,457 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1330 transitions. [2024-10-11 19:14:19,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:14:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1330 transitions. [2024-10-11 19:14:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 19:14:19,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:19,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:19,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 19:14:19,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:19,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:19,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1463238595, now seen corresponding path program 1 times [2024-10-11 19:14:19,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:19,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002196310] [2024-10-11 19:14:19,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:14:19,661 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-11 19:14:19,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:19,664 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:19,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:14:19,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:14:19,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:14:19,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:14:19,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:19,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002196310] [2024-10-11 19:14:19,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002196310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:14:19,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:14:19,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:14:19,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480071639] [2024-10-11 19:14:19,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:14:19,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:14:19,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:19,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:14:19,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:14:19,828 INFO L87 Difference]: Start difference. First operand 1106 states and 1330 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-11 19:14:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:20,696 INFO L93 Difference]: Finished difference Result 1091 states and 1308 transitions. [2024-10-11 19:14:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:14:20,698 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-11 19:14:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:20,703 INFO L225 Difference]: With dead ends: 1091 [2024-10-11 19:14:20,704 INFO L226 Difference]: Without dead ends: 1091 [2024-10-11 19:14:20,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:14:20,705 INFO L432 NwaCegarLoop]: 877 mSDtfsCounter, 45 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2613 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:20,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2613 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:14:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2024-10-11 19:14:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1091. [2024-10-11 19:14:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 603 states have (on average 2.1160862354892207) internal successors, (1276), 1082 states have internal predecessors, (1276), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:14:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1308 transitions. [2024-10-11 19:14:20,727 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1308 transitions. Word has length 12 [2024-10-11 19:14:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:20,728 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 1308 transitions. [2024-10-11 19:14:20,728 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-11 19:14:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1308 transitions. [2024-10-11 19:14:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 19:14:20,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:20,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:20,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 19:14:20,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:20,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:20,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:20,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1140034283, now seen corresponding path program 1 times [2024-10-11 19:14:20,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:20,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602916569] [2024-10-11 19:14:20,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:14:20,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:14:20,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:20,932 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:20,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:14:21,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:14:21,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:21,077 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-11 19:14:21,160 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-11 19:14:21,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:14:21,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:21,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602916569] [2024-10-11 19:14:21,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602916569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:14:21,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:14:21,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:14:21,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504609651] [2024-10-11 19:14:21,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:14:21,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:14:21,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:21,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:14:21,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:14:21,162 INFO L87 Difference]: Start difference. First operand 1091 states and 1308 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-11 19:14:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:22,955 INFO L93 Difference]: Finished difference Result 1091 states and 1308 transitions. [2024-10-11 19:14:22,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:14:22,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 19:14:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:22,959 INFO L225 Difference]: With dead ends: 1091 [2024-10-11 19:14:22,959 INFO L226 Difference]: Without dead ends: 1091 [2024-10-11 19:14:22,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:14:22,960 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 870 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:22,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 820 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 19:14:22,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2024-10-11 19:14:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1087. [2024-10-11 19:14:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 603 states have (on average 2.109452736318408) internal successors, (1272), 1078 states have internal predecessors, (1272), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:14:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1304 transitions. [2024-10-11 19:14:22,979 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1304 transitions. Word has length 26 [2024-10-11 19:14:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:22,979 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1304 transitions. [2024-10-11 19:14:22,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-11 19:14:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1304 transitions. [2024-10-11 19:14:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 19:14:22,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:22,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:22,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:23,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:23,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:23,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1140034284, now seen corresponding path program 1 times [2024-10-11 19:14:23,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:23,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751954164] [2024-10-11 19:14:23,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:14:23,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:14:23,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:23,184 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:23,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:14:23,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:14:23,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:23,348 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-11 19:14:23,556 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-11 19:14:23,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:14:23,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:23,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751954164] [2024-10-11 19:14:23,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751954164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:14:23,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:14:23,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:14:23,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780243518] [2024-10-11 19:14:23,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:14:23,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:14:23,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:23,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:14:23,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:14:23,558 INFO L87 Difference]: Start difference. First operand 1087 states and 1304 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-11 19:14:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:25,953 INFO L93 Difference]: Finished difference Result 1238 states and 1322 transitions. [2024-10-11 19:14:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:14:25,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 19:14:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:25,957 INFO L225 Difference]: With dead ends: 1238 [2024-10-11 19:14:25,957 INFO L226 Difference]: Without dead ends: 1238 [2024-10-11 19:14:25,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:14:25,958 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 404 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:25,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1540 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 19:14:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2024-10-11 19:14:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1083. [2024-10-11 19:14:25,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 603 states have (on average 2.1028192371475956) internal successors, (1268), 1074 states have internal predecessors, (1268), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:14:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1300 transitions. [2024-10-11 19:14:25,980 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1300 transitions. Word has length 26 [2024-10-11 19:14:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:25,981 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1300 transitions. [2024-10-11 19:14:25,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-11 19:14:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1300 transitions. [2024-10-11 19:14:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 19:14:25,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:25,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:25,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:26,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:26,184 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:26,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash -206024091, now seen corresponding path program 1 times [2024-10-11 19:14:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:26,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665541922] [2024-10-11 19:14:26,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:14:26,186 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-11 19:14:26,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:26,189 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:26,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:14:26,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:14:26,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:26,426 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-11 19:14:26,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:14:26,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:26,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665541922] [2024-10-11 19:14:26,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665541922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:14:26,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:14:26,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:14:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635649820] [2024-10-11 19:14:26,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:14:26,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:14:26,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:26,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:14:26,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:14:26,429 INFO L87 Difference]: Start difference. First operand 1083 states and 1300 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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-11 19:14:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:27,259 INFO L93 Difference]: Finished difference Result 1077 states and 1290 transitions. [2024-10-11 19:14:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:14:27,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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 42 [2024-10-11 19:14:27,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:27,264 INFO L225 Difference]: With dead ends: 1077 [2024-10-11 19:14:27,264 INFO L226 Difference]: Without dead ends: 1077 [2024-10-11 19:14:27,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-11 19:14:27,264 INFO L432 NwaCegarLoop]: 871 mSDtfsCounter, 15 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:27,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2596 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:14:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-10-11 19:14:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1077. [2024-10-11 19:14:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 597 states have (on average 2.107202680067002) internal successors, (1258), 1068 states have internal predecessors, (1258), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:14:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1290 transitions. [2024-10-11 19:14:27,282 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1290 transitions. Word has length 42 [2024-10-11 19:14:27,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:27,283 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1290 transitions. [2024-10-11 19:14:27,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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-11 19:14:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1290 transitions. [2024-10-11 19:14:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 19:14:27,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:27,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:27,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-11 19:14:27,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:27,489 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:27,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:27,489 INFO L85 PathProgramCache]: Analyzing trace with hash -317919035, now seen corresponding path program 1 times [2024-10-11 19:14:27,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:27,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273644967] [2024-10-11 19:14:27,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:14:27,490 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-11 19:14:27,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:27,491 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:27,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:14:27,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:14:27,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:27,931 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-11 19:14:27,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:14:27,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:27,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273644967] [2024-10-11 19:14:27,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273644967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:14:27,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:14:27,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:14:27,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003279538] [2024-10-11 19:14:27,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:14:27,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:14:27,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:27,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:14:27,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:14:27,933 INFO L87 Difference]: Start difference. First operand 1077 states and 1290 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 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-11 19:14:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:28,469 INFO L93 Difference]: Finished difference Result 1120 states and 1333 transitions. [2024-10-11 19:14:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:14:28,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-11 19:14:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:28,473 INFO L225 Difference]: With dead ends: 1120 [2024-10-11 19:14:28,473 INFO L226 Difference]: Without dead ends: 1120 [2024-10-11 19:14:28,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-11 19:14:28,474 INFO L432 NwaCegarLoop]: 886 mSDtfsCounter, 0 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:28,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1746 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:14:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2024-10-11 19:14:28,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1120. [2024-10-11 19:14:28,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 640 states have (on average 2.0328125) internal successors, (1301), 1111 states have internal predecessors, (1301), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:14:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1333 transitions. [2024-10-11 19:14:28,492 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1333 transitions. Word has length 46 [2024-10-11 19:14:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:28,492 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1333 transitions. [2024-10-11 19:14:28,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 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-11 19:14:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1333 transitions. [2024-10-11 19:14:28,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 19:14:28,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:28,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:28,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-11 19:14:28,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:28,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:28,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:28,699 INFO L85 PathProgramCache]: Analyzing trace with hash -830556838, now seen corresponding path program 1 times [2024-10-11 19:14:28,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:28,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568107958] [2024-10-11 19:14:28,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:14:28,700 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-11 19:14:28,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:28,703 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:28,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:14:29,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:14:29,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:29,029 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-11 19:14:29,038 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-11 19:14:29,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:14:29,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:14:29,486 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:14:29,487 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-11 19:14:29,502 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-11 19:14:29,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:14:29,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:29,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568107958] [2024-10-11 19:14:29,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568107958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:14:29,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:14:29,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:14:29,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309355379] [2024-10-11 19:14:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:14:29,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:14:29,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:29,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:14:29,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:14:29,507 INFO L87 Difference]: Start difference. First operand 1120 states and 1333 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:14:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:30,955 INFO L93 Difference]: Finished difference Result 1036 states and 1249 transitions. [2024-10-11 19:14:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:14:30,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-11 19:14:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:30,959 INFO L225 Difference]: With dead ends: 1036 [2024-10-11 19:14:30,959 INFO L226 Difference]: Without dead ends: 1036 [2024-10-11 19:14:30,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:14:30,960 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 782 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:30,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 344 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 19:14:30,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2024-10-11 19:14:30,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 897. [2024-10-11 19:14:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 501 states have (on average 1.8463073852295409) internal successors, (925), 888 states have internal predecessors, (925), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:14:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 957 transitions. [2024-10-11 19:14:30,977 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 957 transitions. Word has length 49 [2024-10-11 19:14:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:30,977 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 957 transitions. [2024-10-11 19:14:30,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:14:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 957 transitions. [2024-10-11 19:14:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 19:14:30,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:30,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:30,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:31,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:31,179 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:31,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1163183004, now seen corresponding path program 1 times [2024-10-11 19:14:31,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:31,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761598233] [2024-10-11 19:14:31,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:14:31,181 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-11 19:14:31,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:31,185 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:31,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:14:31,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:14:31,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:31,399 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-11 19:14:31,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:14:31,430 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 23 treesize of output 11 [2024-10-11 19:14:31,451 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-11 19:14:31,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:14:31,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:31,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761598233] [2024-10-11 19:14:31,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761598233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:14:31,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:14:31,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:14:31,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134397071] [2024-10-11 19:14:31,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:14:31,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:14:31,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:31,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:14:31,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:14:31,453 INFO L87 Difference]: Start difference. First operand 897 states and 957 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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-11 19:14:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:33,373 INFO L93 Difference]: Finished difference Result 896 states and 956 transitions. [2024-10-11 19:14:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:14:33,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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 53 [2024-10-11 19:14:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:33,376 INFO L225 Difference]: With dead ends: 896 [2024-10-11 19:14:33,376 INFO L226 Difference]: Without dead ends: 896 [2024-10-11 19:14:33,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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-11 19:14:33,377 INFO L432 NwaCegarLoop]: 799 mSDtfsCounter, 2 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:33,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2075 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 19:14:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-10-11 19:14:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2024-10-11 19:14:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 501 states have (on average 1.844311377245509) internal successors, (924), 887 states have internal predecessors, (924), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:14:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 956 transitions. [2024-10-11 19:14:33,389 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 956 transitions. Word has length 53 [2024-10-11 19:14:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:33,390 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 956 transitions. [2024-10-11 19:14:33,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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-11 19:14:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 956 transitions. [2024-10-11 19:14:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 19:14:33,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:33,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:33,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:33,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:33,592 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:33,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:33,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1163183003, now seen corresponding path program 1 times [2024-10-11 19:14:33,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:33,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338081769] [2024-10-11 19:14:33,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:14:33,593 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-11 19:14:33,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:33,594 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:33,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:14:33,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:14:33,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:33,823 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-11 19:14:33,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 19:14:33,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:14:33,889 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 21 treesize of output 9 [2024-10-11 19:14:33,910 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-11 19:14:33,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:14:33,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:33,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338081769] [2024-10-11 19:14:33,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338081769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:14:33,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:14:33,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:14:33,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086859424] [2024-10-11 19:14:33,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:14:33,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:14:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:33,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:14:33,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:14:33,913 INFO L87 Difference]: Start difference. First operand 896 states and 956 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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-11 19:14:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:36,215 INFO L93 Difference]: Finished difference Result 895 states and 955 transitions. [2024-10-11 19:14:36,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:14:36,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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 53 [2024-10-11 19:14:36,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:36,218 INFO L225 Difference]: With dead ends: 895 [2024-10-11 19:14:36,218 INFO L226 Difference]: Without dead ends: 895 [2024-10-11 19:14:36,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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-11 19:14:36,218 INFO L432 NwaCegarLoop]: 799 mSDtfsCounter, 1 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:36,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2090 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 19:14:36,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-10-11 19:14:36,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 895. [2024-10-11 19:14:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 500 states have (on average 1.846) internal successors, (923), 886 states have internal predecessors, (923), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 19:14:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 955 transitions. [2024-10-11 19:14:36,233 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 955 transitions. Word has length 53 [2024-10-11 19:14:36,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:36,234 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 955 transitions. [2024-10-11 19:14:36,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 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-11 19:14:36,235 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 955 transitions. [2024-10-11 19:14:36,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 19:14:36,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:36,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:36,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:36,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:36,437 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:36,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:36,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1831471864, now seen corresponding path program 1 times [2024-10-11 19:14:36,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:36,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625096196] [2024-10-11 19:14:36,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:14:36,438 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-11 19:14:36,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:36,439 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:36,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:14:36,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:14:36,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:36,669 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-11 19:14:36,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:14:36,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:36,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625096196] [2024-10-11 19:14:36,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625096196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:14:36,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:14:36,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:14:36,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747077875] [2024-10-11 19:14:36,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:14:36,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:14:36,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:36,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:14:36,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:14:36,672 INFO L87 Difference]: Start difference. First operand 895 states and 955 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 19:14:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:37,430 INFO L93 Difference]: Finished difference Result 897 states and 959 transitions. [2024-10-11 19:14:37,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:14:37,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-10-11 19:14:37,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:37,434 INFO L225 Difference]: With dead ends: 897 [2024-10-11 19:14:37,434 INFO L226 Difference]: Without dead ends: 897 [2024-10-11 19:14:37,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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-11 19:14:37,435 INFO L432 NwaCegarLoop]: 798 mSDtfsCounter, 0 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2388 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:37,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2388 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:14:37,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-10-11 19:14:37,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2024-10-11 19:14:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 501 states have (on average 1.8463073852295409) internal successors, (925), 888 states have internal predecessors, (925), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-11 19:14:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 959 transitions. [2024-10-11 19:14:37,450 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 959 transitions. Word has length 59 [2024-10-11 19:14:37,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:37,450 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 959 transitions. [2024-10-11 19:14:37,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 19:14:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 959 transitions. [2024-10-11 19:14:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 19:14:37,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:37,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:37,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:37,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:37,652 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:37,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:37,653 INFO L85 PathProgramCache]: Analyzing trace with hash 544816737, now seen corresponding path program 1 times [2024-10-11 19:14:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:37,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443073732] [2024-10-11 19:14:37,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:14:37,654 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-11 19:14:37,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:37,658 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:37,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:14:37,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:14:37,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:37,976 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-11 19:14:37,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:14:38,046 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-11 19:14:38,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:38,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443073732] [2024-10-11 19:14:38,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443073732] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:14:38,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:14:38,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 19:14:38,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500983236] [2024-10-11 19:14:38,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:14:38,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:14:38,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:38,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:14:38,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:14:38,049 INFO L87 Difference]: Start difference. First operand 897 states and 959 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:14:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:39,329 INFO L93 Difference]: Finished difference Result 906 states and 974 transitions. [2024-10-11 19:14:39,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:14:39,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2024-10-11 19:14:39,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:39,332 INFO L225 Difference]: With dead ends: 906 [2024-10-11 19:14:39,332 INFO L226 Difference]: Without dead ends: 906 [2024-10-11 19:14:39,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:14:39,332 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 5 mSDsluCounter, 3962 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4758 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:39,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4758 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:14:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-10-11 19:14:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 905. [2024-10-11 19:14:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 508 states have (on average 1.8464566929133859) internal successors, (938), 895 states have internal predecessors, (938), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-11 19:14:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 972 transitions. [2024-10-11 19:14:39,346 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 972 transitions. Word has length 60 [2024-10-11 19:14:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:39,346 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 972 transitions. [2024-10-11 19:14:39,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:14:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 972 transitions. [2024-10-11 19:14:39,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 19:14:39,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:39,347 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:39,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 19:14:39,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:39,549 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:39,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:39,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2046164152, now seen corresponding path program 2 times [2024-10-11 19:14:39,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:39,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868980293] [2024-10-11 19:14:39,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:14:39,550 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-11 19:14:39,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:39,553 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:39,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:39,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:14:39,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:14:39,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:14:39,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:14:39,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:14:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:14:40,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:40,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868980293] [2024-10-11 19:14:40,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868980293] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:14:40,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:14:40,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 19:14:40,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467595288] [2024-10-11 19:14:40,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:14:40,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:14:40,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:40,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:14:40,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:14:40,121 INFO L87 Difference]: Start difference. First operand 905 states and 972 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:14:41,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:41,597 INFO L93 Difference]: Finished difference Result 917 states and 992 transitions. [2024-10-11 19:14:41,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:14:41,598 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2024-10-11 19:14:41,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:41,603 INFO L225 Difference]: With dead ends: 917 [2024-10-11 19:14:41,603 INFO L226 Difference]: Without dead ends: 915 [2024-10-11 19:14:41,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 19:14:41,606 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 8 mSDsluCounter, 3970 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4766 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:41,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4766 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 19:14:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2024-10-11 19:14:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 914. [2024-10-11 19:14:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 517 states have (on average 1.8375241779497098) internal successors, (950), 904 states have internal predecessors, (950), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-11 19:14:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 984 transitions. [2024-10-11 19:14:41,622 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 984 transitions. Word has length 63 [2024-10-11 19:14:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:41,623 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 984 transitions. [2024-10-11 19:14:41,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:14:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 984 transitions. [2024-10-11 19:14:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 19:14:41,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:41,623 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:41,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:41,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:41,824 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:41,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:41,825 INFO L85 PathProgramCache]: Analyzing trace with hash -894894936, now seen corresponding path program 3 times [2024-10-11 19:14:41,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:41,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136748547] [2024-10-11 19:14:41,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:14:41,825 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-11 19:14:41,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:41,826 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:41,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:42,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:14:42,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:14:42,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:14:42,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:14:42,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:14:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:14:42,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:42,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136748547] [2024-10-11 19:14:42,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136748547] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:14:42,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:14:42,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 19:14:42,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306004215] [2024-10-11 19:14:42,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:14:42,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:14:42,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:42,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:14:42,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:14:42,853 INFO L87 Difference]: Start difference. First operand 914 states and 984 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:14:46,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:46,632 INFO L93 Difference]: Finished difference Result 935 states and 1020 transitions. [2024-10-11 19:14:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 19:14:46,633 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-10-11 19:14:46,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:46,636 INFO L225 Difference]: With dead ends: 935 [2024-10-11 19:14:46,636 INFO L226 Difference]: Without dead ends: 932 [2024-10-11 19:14:46,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 19:14:46,637 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 13 mSDsluCounter, 8730 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9526 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:46,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 9526 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 19:14:46,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-10-11 19:14:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2024-10-11 19:14:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 535 states have (on average 1.8186915887850468) internal successors, (973), 922 states have internal predecessors, (973), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-11 19:14:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1007 transitions. [2024-10-11 19:14:46,652 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1007 transitions. Word has length 69 [2024-10-11 19:14:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:46,653 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1007 transitions. [2024-10-11 19:14:46,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:14:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1007 transitions. [2024-10-11 19:14:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 19:14:46,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:46,656 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:46,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:46,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:46,857 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:46,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:46,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1865197720, now seen corresponding path program 4 times [2024-10-11 19:14:46,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:46,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659769716] [2024-10-11 19:14:46,858 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:14:46,858 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-11 19:14:46,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:46,859 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:46,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:47,268 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:14:47,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:14:47,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 19:14:47,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:14:47,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:14:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:14:48,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:14:48,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659769716] [2024-10-11 19:14:48,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659769716] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:14:48,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:14:48,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 19:14:48,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890277241] [2024-10-11 19:14:48,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:14:48,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 19:14:48,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:14:48,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 19:14:48,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 19:14:48,751 INFO L87 Difference]: Start difference. First operand 932 states and 1007 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:14:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:14:58,381 INFO L93 Difference]: Finished difference Result 969 states and 1077 transitions. [2024-10-11 19:14:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 19:14:58,381 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-10-11 19:14:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:14:58,384 INFO L225 Difference]: With dead ends: 969 [2024-10-11 19:14:58,385 INFO L226 Difference]: Without dead ends: 967 [2024-10-11 19:14:58,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 19:14:58,387 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 26 mSDsluCounter, 23804 mSDsCounter, 0 mSdLazyCounter, 5367 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 24600 SdHoareTripleChecker+Invalid, 5446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 5367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:14:58,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 24600 Invalid, 5446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 5367 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-10-11 19:14:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2024-10-11 19:14:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 966. [2024-10-11 19:14:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 569 states have (on average 1.7908611599297013) internal successors, (1019), 956 states have internal predecessors, (1019), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-11 19:14:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1053 transitions. [2024-10-11 19:14:58,397 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1053 transitions. Word has length 81 [2024-10-11 19:14:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:14:58,398 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1053 transitions. [2024-10-11 19:14:58,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:14:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1053 transitions. [2024-10-11 19:14:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 19:14:58,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:14:58,399 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:14:58,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Ended with exit code 0 [2024-10-11 19:14:58,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.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-11 19:14:58,600 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-11 19:14:58,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:14:58,601 INFO L85 PathProgramCache]: Analyzing trace with hash 307540424, now seen corresponding path program 5 times [2024-10-11 19:14:58,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:14:58,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870804553] [2024-10-11 19:14:58,601 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:14:58,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:14:58,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:14:58,603 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:58,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:14:59,680 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-11 19:14:59,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:14:59,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-11 19:14:59,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:14:59,740 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-11 19:14:59,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-10-11 19:15:00,099 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-10-11 19:15:00,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-10-11 19:15:00,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:15:00,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2024-10-11 19:15:02,559 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 19:15:02,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-10-11 19:15:02,662 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 51 treesize of output 27 [2024-10-11 19:15:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-11 19:15:02,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:15:03,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:15:03,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870804553] [2024-10-11 19:15:03,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870804553] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:15:03,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1493360664] [2024-10-11 19:15:03,081 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:15:03,081 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 19:15:03,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 19:15:03,084 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 19:15:03,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process