./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_SAX_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d993ff45e37665d9abd93530677e1201b0648bf8ee13fa84b0c68926f580d988 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:01:44,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:01:44,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:01:44,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:01:44,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:01:44,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:01:44,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:01:44,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:01:44,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:01:44,896 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:01:44,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:01:44,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:01:44,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:01:44,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:01:44,899 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:01:44,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:01:44,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:01:44,900 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:01:44,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:01:44,900 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:01:44,900 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:01:44,901 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:01:44,901 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:01:44,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:01:44,904 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:01:44,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:01:44,904 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:01:44,904 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:01:44,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:01:44,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:01:44,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:01:44,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:01:44,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:01:44,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:01:44,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:01:44,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:01:44,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:01:44,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:01:44,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:01:44,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:01:44,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:01:44,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:01:44,907 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d993ff45e37665d9abd93530677e1201b0648bf8ee13fa84b0c68926f580d988 [2024-10-13 12:01:45,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:01:45,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:01:45,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:01:45,194 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:01:45,195 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:01:45,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i [2024-10-13 12:01:46,536 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:01:46,853 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:01:46,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i [2024-10-13 12:01:46,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb8d4316c/cf47ae2f1ac544e9926e3cbb3aa92b73/FLAG2b9c26ced [2024-10-13 12:01:47,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb8d4316c/cf47ae2f1ac544e9926e3cbb3aa92b73 [2024-10-13 12:01:47,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:01:47,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:01:47,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:01:47,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:01:47,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:01:47,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:01:47" (1/1) ... [2024-10-13 12:01:47,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1b179c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:47, skipping insertion in model container [2024-10-13 12:01:47,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:01:47" (1/1) ... [2024-10-13 12:01:47,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:01:47,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:01:47,867 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 12:01:47,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@eb32562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:47, skipping insertion in model container [2024-10-13 12:01:47,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:01:47,869 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 12:01:47,870 INFO L158 Benchmark]: Toolchain (without parser) took 758.79ms. Allocated memory is still 184.5MB. Free memory was 110.6MB in the beginning and 126.8MB in the end (delta: -16.2MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-10-13 12:01:47,871 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory was 151.3MB in the beginning and 151.3MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:01:47,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 754.11ms. Allocated memory is still 184.5MB. Free memory was 110.6MB in the beginning and 127.6MB in the end (delta: -16.9MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-10-13 12:01:47,873 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.20ms. Allocated memory is still 184.5MB. Free memory was 151.3MB in the beginning and 151.3MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 754.11ms. Allocated memory is still 184.5MB. Free memory was 110.6MB in the beginning and 127.6MB in the end (delta: -16.9MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d993ff45e37665d9abd93530677e1201b0648bf8ee13fa84b0c68926f580d988 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:01:50,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:01:50,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:01:50,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:01:50,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:01:50,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:01:50,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:01:50,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:01:50,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:01:50,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:01:50,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:01:50,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:01:50,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:01:50,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:01:50,426 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:01:50,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:01:50,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:01:50,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:01:50,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:01:50,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:01:50,428 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:01:50,431 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:01:50,432 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:01:50,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:01:50,432 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:01:50,432 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:01:50,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:01:50,433 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:01:50,433 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:01:50,433 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:01:50,434 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:01:50,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:01:50,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:01:50,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:01:50,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:01:50,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:01:50,436 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:01:50,436 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:01:50,437 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:01:50,437 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:01:50,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:01:50,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:01:50,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:01:50,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:01:50,442 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:01:50,442 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d993ff45e37665d9abd93530677e1201b0648bf8ee13fa84b0c68926f580d988 [2024-10-13 12:01:50,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:01:50,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:01:50,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:01:50,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:01:50,849 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:01:50,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i [2024-10-13 12:01:52,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:01:53,438 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:01:53,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-2.i [2024-10-13 12:01:53,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66975b215/ca57b8a414a74edeb5a5eb7554539d00/FLAGdd0c6ab2c [2024-10-13 12:01:53,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66975b215/ca57b8a414a74edeb5a5eb7554539d00 [2024-10-13 12:01:53,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:01:53,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:01:53,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:01:53,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:01:53,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:01:53,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:01:53" (1/1) ... [2024-10-13 12:01:53,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2041fa54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:53, skipping insertion in model container [2024-10-13 12:01:53,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:01:53" (1/1) ... [2024-10-13 12:01:53,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:01:54,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:01:54,462 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 12:01:54,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:01:54,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:01:54,640 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:01:54,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:01:54,802 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:01:54,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:54 WrapperNode [2024-10-13 12:01:54,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:01:54,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:01:54,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:01:54,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:01:54,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:54" (1/1) ... [2024-10-13 12:01:54,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:54" (1/1) ... [2024-10-13 12:01:54,963 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3062 [2024-10-13 12:01:54,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:01:54,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:01:54,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:01:54,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:01:54,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:54" (1/1) ... [2024-10-13 12:01:54,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:54" (1/1) ... [2024-10-13 12:01:55,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:54" (1/1) ... [2024-10-13 12:01:55,101 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-13 12:01:55,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:54" (1/1) ... [2024-10-13 12:01:55,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:54" (1/1) ... [2024-10-13 12:01:55,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:54" (1/1) ... [2024-10-13 12:01:55,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:54" (1/1) ... [2024-10-13 12:01:55,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:54" (1/1) ... [2024-10-13 12:01:55,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:54" (1/1) ... [2024-10-13 12:01:55,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:01:55,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:01:55,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:01:55,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:01:55,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:54" (1/1) ... [2024-10-13 12:01:55,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:01:55,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:01:55,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:01:55,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:01:55,364 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 12:01:55,364 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 12:01:55,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 12:01:55,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 12:01:55,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 12:01:55,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 12:01:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 12:01:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 12:01:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 12:01:55,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 12:01:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 12:01:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 12:01:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 12:01:55,367 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 12:01:55,368 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 12:01:55,368 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 12:01:55,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 12:01:55,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:01:55,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 12:01:55,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 12:01:55,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 12:01:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 12:01:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 12:01:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 12:01:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 12:01:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 12:01:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 12:01:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 12:01:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 12:01:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:01:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 12:01:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 12:01:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:01:55,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:01:55,661 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:01:55,663 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:01:55,686 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 12:01:55,723 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 12:01:55,761 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 12:02:00,255 INFO L? ?]: Removed 1596 outVars from TransFormulas that were not future-live. [2024-10-13 12:02:00,256 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:02:00,407 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:02:00,407 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-13 12:02:00,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:02:00 BoogieIcfgContainer [2024-10-13 12:02:00,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:02:00,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:02:00,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:02:00,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:02:00,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:01:53" (1/3) ... [2024-10-13 12:02:00,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f906ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:02:00, skipping insertion in model container [2024-10-13 12:02:00,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:54" (2/3) ... [2024-10-13 12:02:00,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f906ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:02:00, skipping insertion in model container [2024-10-13 12:02:00,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:02:00" (3/3) ... [2024-10-13 12:02:00,414 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test9-2.i [2024-10-13 12:02:00,428 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:02:00,428 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-10-13 12:02:00,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:02:00,516 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;@113f2d75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:02:00,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-10-13 12:02:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 1968 states, 933 states have (on average 2.234726688102894) internal successors, (2085), 1961 states have internal predecessors, (2085), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-10-13 12:02:00,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 12:02:00,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:00,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 12:02:00,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:00,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:00,535 INFO L85 PathProgramCache]: Analyzing trace with hash 178352, now seen corresponding path program 1 times [2024-10-13 12:02:00,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:00,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193876870] [2024-10-13 12:02:00,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:00,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:00,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:00,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:00,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 12:02:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:00,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:02:00,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:00,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:02:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:00,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:00,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:00,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193876870] [2024-10-13 12:02:00,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193876870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:00,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:00,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:02:00,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253436521] [2024-10-13 12:02:00,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:00,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:02:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:00,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:02:00,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:00,824 INFO L87 Difference]: Start difference. First operand has 1968 states, 933 states have (on average 2.234726688102894) internal successors, (2085), 1961 states have internal predecessors, (2085), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:03,198 INFO L93 Difference]: Finished difference Result 2118 states and 3185 transitions. [2024-10-13 12:02:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:02:03,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 12:02:03,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:03,271 INFO L225 Difference]: With dead ends: 2118 [2024-10-13 12:02:03,275 INFO L226 Difference]: Without dead ends: 2117 [2024-10-13 12:02:03,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:03,279 INFO L432 NwaCegarLoop]: 2523 mSDtfsCounter, 1881 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:03,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 2651 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 12:02:03,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2024-10-13 12:02:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 1953. [2024-10-13 12:02:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1953 states, 936 states have (on average 2.139957264957265) internal successors, (2003), 1946 states have internal predecessors, (2003), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 12:02:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 3011 transitions. [2024-10-13 12:02:03,595 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 3011 transitions. Word has length 2 [2024-10-13 12:02:03,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:03,595 INFO L471 AbstractCegarLoop]: Abstraction has 1953 states and 3011 transitions. [2024-10-13 12:02:03,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 3011 transitions. [2024-10-13 12:02:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 12:02:03,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:03,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 12:02:03,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:02:03,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:03,800 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:03,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:03,801 INFO L85 PathProgramCache]: Analyzing trace with hash 178353, now seen corresponding path program 1 times [2024-10-13 12:02:03,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:03,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136639297] [2024-10-13 12:02:03,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:03,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:03,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:03,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:03,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 12:02:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:03,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:02:03,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:03,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:02:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:03,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:03,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:03,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136639297] [2024-10-13 12:02:03,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136639297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:03,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:03,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:02:03,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828077222] [2024-10-13 12:02:03,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:03,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:02:03,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:03,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:02:03,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:03,930 INFO L87 Difference]: Start difference. First operand 1953 states and 3011 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:08,116 INFO L93 Difference]: Finished difference Result 3330 states and 5421 transitions. [2024-10-13 12:02:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:02:08,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 12:02:08,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:08,137 INFO L225 Difference]: With dead ends: 3330 [2024-10-13 12:02:08,137 INFO L226 Difference]: Without dead ends: 3330 [2024-10-13 12:02:08,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:08,140 INFO L432 NwaCegarLoop]: 2831 mSDtfsCounter, 1409 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1909 SdHoareTripleChecker+Valid, 4814 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:08,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1909 Valid, 4814 Invalid, 1281 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-13 12:02:08,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2024-10-13 12:02:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 3059. [2024-10-13 12:02:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 1543 states have (on average 2.084899546338302) internal successors, (3217), 3052 states have internal predecessors, (3217), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 12:02:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 5225 transitions. [2024-10-13 12:02:08,431 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 5225 transitions. Word has length 2 [2024-10-13 12:02:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:08,431 INFO L471 AbstractCegarLoop]: Abstraction has 3059 states and 5225 transitions. [2024-10-13 12:02:08,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:08,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 5225 transitions. [2024-10-13 12:02:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 12:02:08,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:08,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:02:08,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 12:02:08,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:08,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:08,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:08,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1503529018, now seen corresponding path program 1 times [2024-10-13 12:02:08,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:08,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633678653] [2024-10-13 12:02:08,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:08,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:08,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:08,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:08,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 12:02:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:08,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:02:08,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:08,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:02:08,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:02:08,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:02:08,873 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-13 12:02:08,891 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:02:08,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 12:02:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:08,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:08,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:08,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633678653] [2024-10-13 12:02:08,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633678653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:08,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:08,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:02:08,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843973211] [2024-10-13 12:02:08,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:08,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:02:08,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:08,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:02:08,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:08,921 INFO L87 Difference]: Start difference. First operand 3059 states and 5225 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:12,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:12,938 INFO L93 Difference]: Finished difference Result 3212 states and 5386 transitions. [2024-10-13 12:02:12,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:02:12,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 12:02:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:12,955 INFO L225 Difference]: With dead ends: 3212 [2024-10-13 12:02:12,955 INFO L226 Difference]: Without dead ends: 3212 [2024-10-13 12:02:12,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:12,958 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 2141 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1960 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2644 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:12,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2644 Valid, 2334 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1960 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-13 12:02:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2024-10-13 12:02:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 1941. [2024-10-13 12:02:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 936 states have (on average 2.126068376068376) internal successors, (1990), 1934 states have internal predecessors, (1990), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 12:02:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2998 transitions. [2024-10-13 12:02:13,276 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2998 transitions. Word has length 6 [2024-10-13 12:02:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:13,277 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 2998 transitions. [2024-10-13 12:02:13,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:13,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2998 transitions. [2024-10-13 12:02:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 12:02:13,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:13,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:13,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 12:02:13,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:13,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:13,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:13,481 INFO L85 PathProgramCache]: Analyzing trace with hash -635240696, now seen corresponding path program 1 times [2024-10-13 12:02:13,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:13,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391471180] [2024-10-13 12:02:13,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:13,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:13,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:13,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:13,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 12:02:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:13,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:02:13,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:13,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:02:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:13,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:13,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:13,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391471180] [2024-10-13 12:02:13,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391471180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:13,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:13,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:02:13,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233331497] [2024-10-13 12:02:13,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:13,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:02:13,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:13,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:02:13,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:13,679 INFO L87 Difference]: Start difference. First operand 1941 states and 2998 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:16,866 INFO L93 Difference]: Finished difference Result 3199 states and 5285 transitions. [2024-10-13 12:02:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:02:16,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 12:02:16,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:16,883 INFO L225 Difference]: With dead ends: 3199 [2024-10-13 12:02:16,883 INFO L226 Difference]: Without dead ends: 3199 [2024-10-13 12:02:16,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:16,885 INFO L432 NwaCegarLoop]: 4823 mSDtfsCounter, 1450 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1950 SdHoareTripleChecker+Valid, 7169 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:16,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1950 Valid, 7169 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 12:02:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2024-10-13 12:02:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 1958. [2024-10-13 12:02:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 963 states have (on average 2.12668743509865) internal successors, (2048), 1951 states have internal predecessors, (2048), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 12:02:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 3056 transitions. [2024-10-13 12:02:17,071 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 3056 transitions. Word has length 7 [2024-10-13 12:02:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:17,071 INFO L471 AbstractCegarLoop]: Abstraction has 1958 states and 3056 transitions. [2024-10-13 12:02:17,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 3056 transitions. [2024-10-13 12:02:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 12:02:17,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:17,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:17,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 12:02:17,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:17,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:17,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:17,276 INFO L85 PathProgramCache]: Analyzing trace with hash -635240697, now seen corresponding path program 1 times [2024-10-13 12:02:17,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:17,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35408953] [2024-10-13 12:02:17,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:17,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:17,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:17,282 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:17,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 12:02:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:17,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:02:17,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:17,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:02:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:17,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:17,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:17,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35408953] [2024-10-13 12:02:17,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35408953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:17,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:17,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:02:17,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488071209] [2024-10-13 12:02:17,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:17,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:02:17,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:17,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:02:17,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:17,431 INFO L87 Difference]: Start difference. First operand 1958 states and 3056 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:19,468 INFO L93 Difference]: Finished difference Result 3106 states and 5222 transitions. [2024-10-13 12:02:19,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:02:19,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 12:02:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:19,482 INFO L225 Difference]: With dead ends: 3106 [2024-10-13 12:02:19,482 INFO L226 Difference]: Without dead ends: 3106 [2024-10-13 12:02:19,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:19,483 INFO L432 NwaCegarLoop]: 4624 mSDtfsCounter, 1671 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 6840 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:19,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 6840 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 12:02:19,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2024-10-13 12:02:19,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 1911. [2024-10-13 12:02:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 963 states have (on average 2.0737279335410177) internal successors, (1997), 1904 states have internal predecessors, (1997), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 12:02:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 3005 transitions. [2024-10-13 12:02:19,712 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 3005 transitions. Word has length 7 [2024-10-13 12:02:19,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:19,712 INFO L471 AbstractCegarLoop]: Abstraction has 1911 states and 3005 transitions. [2024-10-13 12:02:19,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 3005 transitions. [2024-10-13 12:02:19,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 12:02:19,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:19,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:19,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 12:02:19,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:19,918 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:19,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:19,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2037912826, now seen corresponding path program 1 times [2024-10-13 12:02:19,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:19,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437651914] [2024-10-13 12:02:19,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:19,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:19,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:19,920 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:19,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 12:02:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:20,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:02:20,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:20,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:20,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:20,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437651914] [2024-10-13 12:02:20,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437651914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:20,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:20,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:02:20,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643314158] [2024-10-13 12:02:20,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:20,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:02:20,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:20,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:02:20,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:20,120 INFO L87 Difference]: Start difference. First operand 1911 states and 3005 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:21,076 INFO L93 Difference]: Finished difference Result 3306 states and 5456 transitions. [2024-10-13 12:02:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:02:21,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 12:02:21,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:21,094 INFO L225 Difference]: With dead ends: 3306 [2024-10-13 12:02:21,095 INFO L226 Difference]: Without dead ends: 3306 [2024-10-13 12:02:21,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:21,096 INFO L432 NwaCegarLoop]: 2877 mSDtfsCounter, 1421 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1921 SdHoareTripleChecker+Valid, 5625 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:21,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1921 Valid, 5625 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 12:02:21,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2024-10-13 12:02:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 3055. [2024-10-13 12:02:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3055 states, 1607 states have (on average 2.031113876789048) internal successors, (3264), 3048 states have internal predecessors, (3264), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 12:02:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 5272 transitions. [2024-10-13 12:02:21,282 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 5272 transitions. Word has length 10 [2024-10-13 12:02:21,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:21,282 INFO L471 AbstractCegarLoop]: Abstraction has 3055 states and 5272 transitions. [2024-10-13 12:02:21,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:21,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 5272 transitions. [2024-10-13 12:02:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 12:02:21,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:21,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:21,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 12:02:21,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:21,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:21,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:21,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1151902019, now seen corresponding path program 1 times [2024-10-13 12:02:21,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:21,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729242074] [2024-10-13 12:02:21,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:21,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:21,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:21,487 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:21,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 12:02:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:21,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:02:21,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:21,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:21,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:21,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729242074] [2024-10-13 12:02:21,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729242074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:21,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:21,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:02:21,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775766936] [2024-10-13 12:02:21,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:21,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:02:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:21,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:02:21,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:21,591 INFO L87 Difference]: Start difference. First operand 3055 states and 5272 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:22,142 INFO L93 Difference]: Finished difference Result 3001 states and 5192 transitions. [2024-10-13 12:02:22,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:02:22,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 12:02:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:22,170 INFO L225 Difference]: With dead ends: 3001 [2024-10-13 12:02:22,174 INFO L226 Difference]: Without dead ends: 3001 [2024-10-13 12:02:22,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:22,175 INFO L432 NwaCegarLoop]: 2780 mSDtfsCounter, 61 mSDsluCounter, 2738 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5518 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:22,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5518 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 12:02:22,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2024-10-13 12:02:22,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 3001. [2024-10-13 12:02:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3001 states, 1577 states have (on average 2.019023462270133) internal successors, (3184), 2994 states have internal predecessors, (3184), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 12:02:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 3001 states and 5192 transitions. [2024-10-13 12:02:22,451 INFO L78 Accepts]: Start accepts. Automaton has 3001 states and 5192 transitions. Word has length 12 [2024-10-13 12:02:22,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:22,451 INFO L471 AbstractCegarLoop]: Abstraction has 3001 states and 5192 transitions. [2024-10-13 12:02:22,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 5192 transitions. [2024-10-13 12:02:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 12:02:22,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:22,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:22,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 12:02:22,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:22,653 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:22,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:22,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2088163371, now seen corresponding path program 1 times [2024-10-13 12:02:22,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:22,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492554685] [2024-10-13 12:02:22,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:22,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:22,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:22,658 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:22,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 12:02:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:22,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:02:22,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:22,820 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:02:22,821 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:02:22,825 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 33 treesize of output 31 [2024-10-13 12:02:22,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:02:22,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2024-10-13 12:02:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:22,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:22,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:22,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492554685] [2024-10-13 12:02:22,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492554685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:22,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:22,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:02:22,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013890870] [2024-10-13 12:02:22,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:22,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:02:22,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:22,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:02:22,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:22,887 INFO L87 Difference]: Start difference. First operand 3001 states and 5192 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:25,574 INFO L93 Difference]: Finished difference Result 5733 states and 9927 transitions. [2024-10-13 12:02:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:02:25,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-13 12:02:25,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:25,595 INFO L225 Difference]: With dead ends: 5733 [2024-10-13 12:02:25,595 INFO L226 Difference]: Without dead ends: 5733 [2024-10-13 12:02:25,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:02:25,596 INFO L432 NwaCegarLoop]: 3033 mSDtfsCounter, 1832 mSDsluCounter, 5307 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2335 SdHoareTripleChecker+Valid, 8340 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:25,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2335 Valid, 8340 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 12:02:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2024-10-13 12:02:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 3000. [2024-10-13 12:02:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3000 states, 1576 states have (on average 2.019035532994924) internal successors, (3182), 2993 states have internal predecessors, (3182), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 12:02:26,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 5190 transitions. [2024-10-13 12:02:26,049 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 5190 transitions. Word has length 13 [2024-10-13 12:02:26,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:26,049 INFO L471 AbstractCegarLoop]: Abstraction has 3000 states and 5190 transitions. [2024-10-13 12:02:26,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 5190 transitions. [2024-10-13 12:02:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 12:02:26,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:26,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:26,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 12:02:26,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:26,252 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:26,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:26,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1245060802, now seen corresponding path program 1 times [2024-10-13 12:02:26,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:26,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711113412] [2024-10-13 12:02:26,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:26,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:26,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:26,255 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:26,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 12:02:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:26,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:02:26,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:26,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:26,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:26,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711113412] [2024-10-13 12:02:26,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711113412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:26,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:26,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:02:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232944924] [2024-10-13 12:02:26,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:26,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:02:26,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:26,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:02:26,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:26,430 INFO L87 Difference]: Start difference. First operand 3000 states and 5190 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:26,955 INFO L93 Difference]: Finished difference Result 2946 states and 5110 transitions. [2024-10-13 12:02:26,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:02:26,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 12:02:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:26,963 INFO L225 Difference]: With dead ends: 2946 [2024-10-13 12:02:26,963 INFO L226 Difference]: Without dead ends: 2946 [2024-10-13 12:02:26,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:26,964 INFO L432 NwaCegarLoop]: 2743 mSDtfsCounter, 61 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5444 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:26,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5444 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 12:02:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2024-10-13 12:02:27,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2946. [2024-10-13 12:02:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 1546 states have (on average 2.0064683053040104) internal successors, (3102), 2939 states have internal predecessors, (3102), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 12:02:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 5110 transitions. [2024-10-13 12:02:27,153 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 5110 transitions. Word has length 15 [2024-10-13 12:02:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:27,153 INFO L471 AbstractCegarLoop]: Abstraction has 2946 states and 5110 transitions. [2024-10-13 12:02:27,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 5110 transitions. [2024-10-13 12:02:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 12:02:27,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:27,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:27,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 12:02:27,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:27,355 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:27,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:27,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1792442104, now seen corresponding path program 1 times [2024-10-13 12:02:27,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:27,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186829911] [2024-10-13 12:02:27,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:27,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:27,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:27,358 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:27,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 12:02:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:27,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:02:27,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:27,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:27,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:27,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186829911] [2024-10-13 12:02:27,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186829911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:27,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:27,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:02:27,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061974028] [2024-10-13 12:02:27,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:27,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:02:27,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:02:27,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:27,509 INFO L87 Difference]: Start difference. First operand 2946 states and 5110 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:28,236 INFO L93 Difference]: Finished difference Result 2930 states and 5066 transitions. [2024-10-13 12:02:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:02:28,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 12:02:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:28,251 INFO L225 Difference]: With dead ends: 2930 [2024-10-13 12:02:28,255 INFO L226 Difference]: Without dead ends: 2930 [2024-10-13 12:02:28,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:02:28,256 INFO L432 NwaCegarLoop]: 2712 mSDtfsCounter, 45 mSDsluCounter, 5406 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8118 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:28,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8118 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 12:02:28,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2024-10-13 12:02:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2930. [2024-10-13 12:02:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2930 states, 1544 states have (on average 1.9805699481865284) internal successors, (3058), 2923 states have internal predecessors, (3058), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 12:02:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 5066 transitions. [2024-10-13 12:02:28,496 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 5066 transitions. Word has length 17 [2024-10-13 12:02:28,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:28,497 INFO L471 AbstractCegarLoop]: Abstraction has 2930 states and 5066 transitions. [2024-10-13 12:02:28,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 5066 transitions. [2024-10-13 12:02:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 12:02:28,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02: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] [2024-10-13 12:02:28,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 12:02:28,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:28,699 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:28,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:28,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1517417210, now seen corresponding path program 1 times [2024-10-13 12:02:28,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:28,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720710478] [2024-10-13 12:02:28,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:28,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:28,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:28,704 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:28,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 12:02:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:28,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:02:28,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:28,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:02:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:28,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:28,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:28,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720710478] [2024-10-13 12:02:28,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720710478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:28,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:28,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:02:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074187639] [2024-10-13 12:02:28,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:28,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:02:28,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:28,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:02:28,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:28,911 INFO L87 Difference]: Start difference. First operand 2930 states and 5066 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:31,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:31,902 INFO L93 Difference]: Finished difference Result 2934 states and 5066 transitions. [2024-10-13 12:02:31,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:02:31,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-13 12:02:31,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:31,909 INFO L225 Difference]: With dead ends: 2934 [2024-10-13 12:02:31,909 INFO L226 Difference]: Without dead ends: 2934 [2024-10-13 12:02:31,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:02:31,910 INFO L432 NwaCegarLoop]: 2469 mSDtfsCounter, 1573 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2076 SdHoareTripleChecker+Valid, 3906 SdHoareTripleChecker+Invalid, 2469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:31,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2076 Valid, 3906 Invalid, 2469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2462 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 12:02:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2024-10-13 12:02:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2926. [2024-10-13 12:02:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 1544 states have (on average 1.9753886010362693) internal successors, (3050), 2919 states have internal predecessors, (3050), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 12:02:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 5058 transitions. [2024-10-13 12:02:32,110 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 5058 transitions. Word has length 31 [2024-10-13 12:02:32,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:32,110 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 5058 transitions. [2024-10-13 12:02:32,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:32,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 5058 transitions. [2024-10-13 12:02:32,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 12:02:32,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:32,112 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] [2024-10-13 12:02:32,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-13 12:02:32,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:32,312 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:32,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1517417209, now seen corresponding path program 1 times [2024-10-13 12:02:32,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:32,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271123250] [2024-10-13 12:02:32,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:32,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:32,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:32,317 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:32,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 12:02:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:32,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:02:32,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:32,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:02:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:32,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:32,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:32,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271123250] [2024-10-13 12:02:32,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271123250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:32,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:32,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:02:32,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794589099] [2024-10-13 12:02:32,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:32,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:02:32,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:32,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:02:32,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:32,565 INFO L87 Difference]: Start difference. First operand 2926 states and 5058 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:36,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:36,388 INFO L93 Difference]: Finished difference Result 5189 states and 9343 transitions. [2024-10-13 12:02:36,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:02:36,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-13 12:02:36,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:36,399 INFO L225 Difference]: With dead ends: 5189 [2024-10-13 12:02:36,400 INFO L226 Difference]: Without dead ends: 5189 [2024-10-13 12:02:36,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:02:36,401 INFO L432 NwaCegarLoop]: 4748 mSDtfsCounter, 1348 mSDsluCounter, 5742 mSDsCounter, 0 mSdLazyCounter, 2673 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1848 SdHoareTripleChecker+Valid, 10490 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:36,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1848 Valid, 10490 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2673 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-13 12:02:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2024-10-13 12:02:36,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 2922. [2024-10-13 12:02:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 1544 states have (on average 1.9702072538860103) internal successors, (3042), 2915 states have internal predecessors, (3042), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 12:02:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 5050 transitions. [2024-10-13 12:02:36,711 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 5050 transitions. Word has length 31 [2024-10-13 12:02:36,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:36,711 INFO L471 AbstractCegarLoop]: Abstraction has 2922 states and 5050 transitions. [2024-10-13 12:02:36,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:36,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 5050 transitions. [2024-10-13 12:02:36,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 12:02:36,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:36,713 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] [2024-10-13 12:02:36,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 12:02:36,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:36,913 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:36,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:36,914 INFO L85 PathProgramCache]: Analyzing trace with hash -453349758, now seen corresponding path program 1 times [2024-10-13 12:02:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:36,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248422066] [2024-10-13 12:02:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:36,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:36,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:36,917 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:36,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 12:02:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:37,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:02:37,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:37,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:37,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:37,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248422066] [2024-10-13 12:02:37,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248422066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:37,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:37,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:02:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361709157] [2024-10-13 12:02:37,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:37,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:02:37,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:37,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:02:37,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:37,267 INFO L87 Difference]: Start difference. First operand 2922 states and 5050 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:37,864 INFO L93 Difference]: Finished difference Result 2910 states and 5030 transitions. [2024-10-13 12:02:37,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:02:37,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-13 12:02:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:37,882 INFO L225 Difference]: With dead ends: 2910 [2024-10-13 12:02:37,882 INFO L226 Difference]: Without dead ends: 2910 [2024-10-13 12:02:37,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:02:37,883 INFO L432 NwaCegarLoop]: 2706 mSDtfsCounter, 15 mSDsluCounter, 5395 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 8101 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:37,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 8101 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 12:02:37,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2024-10-13 12:02:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2024-10-13 12:02:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 1532 states have (on average 1.9725848563968669) internal successors, (3022), 2903 states have internal predecessors, (3022), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 12:02:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 5030 transitions. [2024-10-13 12:02:38,183 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 5030 transitions. Word has length 50 [2024-10-13 12:02:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:38,183 INFO L471 AbstractCegarLoop]: Abstraction has 2910 states and 5030 transitions. [2024-10-13 12:02:38,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 5030 transitions. [2024-10-13 12:02:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 12:02:38,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:38,188 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] [2024-10-13 12:02:38,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 12:02:38,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:38,392 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:38,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1977955968, now seen corresponding path program 1 times [2024-10-13 12:02:38,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:38,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577028577] [2024-10-13 12:02:38,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:38,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:38,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:38,396 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:38,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 12:02:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:38,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:02:38,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:38,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:02:38,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:02:39,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:02:39,116 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-13 12:02:39,127 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:02:39,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 12:02:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:39,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:39,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:39,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577028577] [2024-10-13 12:02:39,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577028577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:39,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:39,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:02:39,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627138385] [2024-10-13 12:02:39,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:39,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:02:39,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:39,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:02:39,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:39,136 INFO L87 Difference]: Start difference. First operand 2910 states and 5030 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:41,898 INFO L93 Difference]: Finished difference Result 2872 states and 4992 transitions. [2024-10-13 12:02:41,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:02:41,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-13 12:02:41,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:41,905 INFO L225 Difference]: With dead ends: 2872 [2024-10-13 12:02:41,905 INFO L226 Difference]: Without dead ends: 2872 [2024-10-13 12:02:41,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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-13 12:02:41,906 INFO L432 NwaCegarLoop]: 2348 mSDtfsCounter, 3012 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3515 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:41,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3515 Valid, 2446 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 12:02:41,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2024-10-13 12:02:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 2845. [2024-10-13 12:02:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 1505 states have (on average 1.9401993355481728) internal successors, (2920), 2838 states have internal predecessors, (2920), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 12:02:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 4928 transitions. [2024-10-13 12:02:42,118 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 4928 transitions. Word has length 54 [2024-10-13 12:02:42,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:42,118 INFO L471 AbstractCegarLoop]: Abstraction has 2845 states and 4928 transitions. [2024-10-13 12:02:42,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 4928 transitions. [2024-10-13 12:02:42,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 12:02:42,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:42,121 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] [2024-10-13 12:02:42,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 12:02:42,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:42,326 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:42,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:42,327 INFO L85 PathProgramCache]: Analyzing trace with hash 637906481, now seen corresponding path program 1 times [2024-10-13 12:02:42,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:42,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669094044] [2024-10-13 12:02:42,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:42,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:42,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:42,332 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:42,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 12:02:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:42,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:02:42,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:42,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:02:42,620 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-13 12:02:42,642 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-13 12:02:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:42,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:42,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:42,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669094044] [2024-10-13 12:02:42,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669094044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:42,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:42,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:02:42,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90176708] [2024-10-13 12:02:42,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:42,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:02:42,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:42,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:02:42,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:02:42,653 INFO L87 Difference]: Start difference. First operand 2845 states and 4928 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:44,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:44,190 INFO L93 Difference]: Finished difference Result 2844 states and 4927 transitions. [2024-10-13 12:02:44,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:02:44,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-13 12:02:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:44,198 INFO L225 Difference]: With dead ends: 2844 [2024-10-13 12:02:44,198 INFO L226 Difference]: Without dead ends: 2844 [2024-10-13 12:02:44,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:02:44,200 INFO L432 NwaCegarLoop]: 2680 mSDtfsCounter, 2 mSDsluCounter, 7105 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 9785 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:44,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 9785 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 12:02:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2024-10-13 12:02:44,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2844. [2024-10-13 12:02:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 1505 states have (on average 1.9395348837209303) internal successors, (2919), 2837 states have internal predecessors, (2919), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 12:02:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 4927 transitions. [2024-10-13 12:02:44,386 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 4927 transitions. Word has length 58 [2024-10-13 12:02:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:44,387 INFO L471 AbstractCegarLoop]: Abstraction has 2844 states and 4927 transitions. [2024-10-13 12:02:44,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 4927 transitions. [2024-10-13 12:02:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 12:02:44,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:44,388 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] [2024-10-13 12:02:44,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-13 12:02:44,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:44,589 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:44,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:44,590 INFO L85 PathProgramCache]: Analyzing trace with hash 637906482, now seen corresponding path program 1 times [2024-10-13 12:02:44,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:44,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634650217] [2024-10-13 12:02:44,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:44,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:44,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:44,593 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:44,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 12:02:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:44,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 12:02:44,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:44,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:02:44,830 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-13 12:02:44,838 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-13 12:02:44,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-13 12:02:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:44,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:44,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:44,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634650217] [2024-10-13 12:02:44,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634650217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:44,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:44,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:02:44,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344518476] [2024-10-13 12:02:44,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:44,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:02:44,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:44,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:02:44,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:02:44,918 INFO L87 Difference]: Start difference. First operand 2844 states and 4927 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:46,685 INFO L93 Difference]: Finished difference Result 2843 states and 4926 transitions. [2024-10-13 12:02:46,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:02:46,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-13 12:02:46,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:46,702 INFO L225 Difference]: With dead ends: 2843 [2024-10-13 12:02:46,702 INFO L226 Difference]: Without dead ends: 2843 [2024-10-13 12:02:46,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:02:46,703 INFO L432 NwaCegarLoop]: 2680 mSDtfsCounter, 1 mSDsluCounter, 7136 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9816 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:46,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9816 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 12:02:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2024-10-13 12:02:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2843. [2024-10-13 12:02:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2843 states, 1504 states have (on average 1.940159574468085) internal successors, (2918), 2836 states have internal predecessors, (2918), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 12:02:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2843 states and 4926 transitions. [2024-10-13 12:02:47,029 INFO L78 Accepts]: Start accepts. Automaton has 2843 states and 4926 transitions. Word has length 58 [2024-10-13 12:02:47,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:47,030 INFO L471 AbstractCegarLoop]: Abstraction has 2843 states and 4926 transitions. [2024-10-13 12:02:47,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2843 states and 4926 transitions. [2024-10-13 12:02:47,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 12:02:47,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:47,030 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, 1, 1, 1, 1] [2024-10-13 12:02:47,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-13 12:02:47,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:47,236 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:47,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:47,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1823588875, now seen corresponding path program 1 times [2024-10-13 12:02:47,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:47,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812140738] [2024-10-13 12:02:47,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:47,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:47,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:47,240 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:47,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 12:02:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:47,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:02:47,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:47,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:47,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:47,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812140738] [2024-10-13 12:02:47,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812140738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:47,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:47,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:02:47,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491449471] [2024-10-13 12:02:47,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:47,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:02:47,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:47,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:02:47,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:47,605 INFO L87 Difference]: Start difference. First operand 2843 states and 4926 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-13 12:02:48,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:48,187 INFO L93 Difference]: Finished difference Result 2845 states and 4929 transitions. [2024-10-13 12:02:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:02:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-13 12:02:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:48,196 INFO L225 Difference]: With dead ends: 2845 [2024-10-13 12:02:48,196 INFO L226 Difference]: Without dead ends: 2845 [2024-10-13 12:02:48,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:48,197 INFO L432 NwaCegarLoop]: 2680 mSDtfsCounter, 0 mSDsluCounter, 5357 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8037 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:48,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8037 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 12:02:48,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2024-10-13 12:02:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2845. [2024-10-13 12:02:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 1505 states have (on average 1.9401993355481728) internal successors, (2920), 2838 states have internal predecessors, (2920), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-13 12:02:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 4929 transitions. [2024-10-13 12:02:48,364 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 4929 transitions. Word has length 64 [2024-10-13 12:02:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:48,365 INFO L471 AbstractCegarLoop]: Abstraction has 2845 states and 4929 transitions. [2024-10-13 12:02:48,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-13 12:02:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 4929 transitions. [2024-10-13 12:02:48,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 12:02:48,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:48,365 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, 1, 1, 1, 1, 1] [2024-10-13 12:02:48,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-13 12:02:48,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:48,570 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:48,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash 763599403, now seen corresponding path program 1 times [2024-10-13 12:02:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:48,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358981166] [2024-10-13 12:02:48,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:48,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:48,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:48,574 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:48,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 12:02:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:48,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:02:48,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:48,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:02:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:48,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:48,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358981166] [2024-10-13 12:02:48,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358981166] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:02:48,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:02:48,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 12:02:48,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180043441] [2024-10-13 12:02:48,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:02:48,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:02:48,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:48,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:02:48,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:02:48,885 INFO L87 Difference]: Start difference. First operand 2845 states and 4929 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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-13 12:02:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:49,917 INFO L93 Difference]: Finished difference Result 2854 states and 4943 transitions. [2024-10-13 12:02:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:02:49,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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 65 [2024-10-13 12:02:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:49,927 INFO L225 Difference]: With dead ends: 2854 [2024-10-13 12:02:49,927 INFO L226 Difference]: Without dead ends: 2854 [2024-10-13 12:02:49,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 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-13 12:02:49,928 INFO L432 NwaCegarLoop]: 2679 mSDtfsCounter, 4 mSDsluCounter, 8032 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10711 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:49,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10711 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 12:02:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2024-10-13 12:02:50,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2853. [2024-10-13 12:02:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 1512 states have (on average 1.9398148148148149) internal successors, (2933), 2845 states have internal predecessors, (2933), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-13 12:02:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4942 transitions. [2024-10-13 12:02:50,160 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4942 transitions. Word has length 65 [2024-10-13 12:02:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:50,161 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 4942 transitions. [2024-10-13 12:02:50,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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-13 12:02:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4942 transitions. [2024-10-13 12:02:50,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 12:02:50,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:50,162 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, 1, 1, 1, 1, 1] [2024-10-13 12:02:50,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-13 12:02:50,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:50,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:50,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:50,363 INFO L85 PathProgramCache]: Analyzing trace with hash 601791349, now seen corresponding path program 2 times [2024-10-13 12:02:50,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:50,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793780616] [2024-10-13 12:02:50,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:02:50,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:50,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:50,367 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:50,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-13 12:02:50,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:02:50,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:02:50,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:02:50,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:50,810 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-13 12:02:50,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:02:50,920 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-13 12:02:50,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:50,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793780616] [2024-10-13 12:02:50,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793780616] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:02:50,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:02:50,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 12:02:50,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202593628] [2024-10-13 12:02:50,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:02:50,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:02:50,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:50,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:02:50,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:02:50,923 INFO L87 Difference]: Start difference. First operand 2853 states and 4942 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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-13 12:02:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:52,933 INFO L93 Difference]: Finished difference Result 2865 states and 4961 transitions. [2024-10-13 12:02:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 12:02:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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 68 [2024-10-13 12:02:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:52,943 INFO L225 Difference]: With dead ends: 2865 [2024-10-13 12:02:52,944 INFO L226 Difference]: Without dead ends: 2863 [2024-10-13 12:02:52,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 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-13 12:02:52,945 INFO L432 NwaCegarLoop]: 2679 mSDtfsCounter, 8 mSDsluCounter, 18744 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 21423 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:52,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 21423 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 12:02:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2024-10-13 12:02:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2862. [2024-10-13 12:02:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 1521 states have (on average 1.9362261669953977) internal successors, (2945), 2854 states have internal predecessors, (2945), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-13 12:02:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 4954 transitions. [2024-10-13 12:02:53,281 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 4954 transitions. Word has length 68 [2024-10-13 12:02:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:53,281 INFO L471 AbstractCegarLoop]: Abstraction has 2862 states and 4954 transitions. [2024-10-13 12:02:53,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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-13 12:02:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 4954 transitions. [2024-10-13 12:02:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 12:02:53,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:53,282 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, 1, 1, 1, 1, 1] [2024-10-13 12:02:53,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-13 12:02:53,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:53,483 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:53,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:53,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2095251531, now seen corresponding path program 3 times [2024-10-13 12:02:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:53,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992181950] [2024-10-13 12:02:53,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:02:53,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:53,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:53,488 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:53,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-13 12:02:54,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 12:02:54,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:02:54,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:02:54,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:54,454 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-13 12:02:54,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:02:54,935 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-13 12:02:54,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:54,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992181950] [2024-10-13 12:02:54,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992181950] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:02:54,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:02:54,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 12:02:54,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462491545] [2024-10-13 12:02:54,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:02:54,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 12:02:54,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:54,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 12:02:54,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 12:02:54,937 INFO L87 Difference]: Start difference. First operand 2862 states and 4954 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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-13 12:02:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:58,880 INFO L93 Difference]: Finished difference Result 2883 states and 4990 transitions. [2024-10-13 12:02:58,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 12:02:58,881 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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 74 [2024-10-13 12:02:58,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:58,887 INFO L225 Difference]: With dead ends: 2883 [2024-10-13 12:02:58,887 INFO L226 Difference]: Without dead ends: 2880 [2024-10-13 12:02:58,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 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-13 12:02:58,888 INFO L432 NwaCegarLoop]: 2679 mSDtfsCounter, 14 mSDsluCounter, 34810 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 37489 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:58,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 37489 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 12:02:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2024-10-13 12:02:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2880. [2024-10-13 12:02:59,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2880 states, 1539 states have (on average 1.9285250162443144) internal successors, (2968), 2872 states have internal predecessors, (2968), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-13 12:02:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4977 transitions. [2024-10-13 12:02:59,085 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4977 transitions. Word has length 74 [2024-10-13 12:02:59,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:59,085 INFO L471 AbstractCegarLoop]: Abstraction has 2880 states and 4977 transitions. [2024-10-13 12:02:59,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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-13 12:02:59,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4977 transitions. [2024-10-13 12:02:59,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 12:02:59,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:59,086 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, 1, 1, 1, 1, 1] [2024-10-13 12:02:59,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-13 12:02:59,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:59,291 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-13 12:02:59,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:59,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1712928821, now seen corresponding path program 4 times [2024-10-13 12:02:59,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:59,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838298085] [2024-10-13 12:02:59,292 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:02:59,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:02:59,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:59,294 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:02:59,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-13 12:02:59,769 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 12:02:59,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:02:59,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 12:02:59,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:00,100 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-13 12:03:00,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:03:01,218 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-13 12:03:01,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:01,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838298085] [2024-10-13 12:03:01,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838298085] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:03:01,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:03:01,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 12:03:01,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832370075] [2024-10-13 12:03:01,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:03:01,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 12:03:01,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:01,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 12:03:01,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 12:03:01,221 INFO L87 Difference]: Start difference. First operand 2880 states and 4977 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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)