./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_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:41:51,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:41:51,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 18:41:51,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:41:51,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:41:51,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:41:51,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:41:51,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:41:51,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:41:51,722 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:41:51,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:41:51,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:41:51,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:41:51,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:41:51,724 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:41:51,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:41:51,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 18:41:51,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:41:51,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 18:41:51,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:41:51,726 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:41:51,734 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:41:51,734 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:41:51,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:41:51,734 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:41:51,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:41:51,735 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:41:51,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 18:41:51,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:41:51,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:41:51,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:41:51,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:41:51,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:41:51,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:41:51,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:41:51,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:41:51,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 18:41:51,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 18:41:51,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:41:51,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:41:51,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:41:51,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:41:51,745 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 -> a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 [2024-10-24 18:41:52,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:41:52,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:41:52,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:41:52,358 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:41:52,363 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:41:52,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2024-10-24 18:41:54,268 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:41:54,572 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:41:54,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2024-10-24 18:41:54,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540e9f06e/03ef89d7d51f44dea3c74e970f4f6c6d/FLAGe4a371a2a [2024-10-24 18:41:54,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540e9f06e/03ef89d7d51f44dea3c74e970f4f6c6d [2024-10-24 18:41:54,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:41:54,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:41:54,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:41:54,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:41:54,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:41:54,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:41:54" (1/1) ... [2024-10-24 18:41:54,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659fceb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:41:54, skipping insertion in model container [2024-10-24 18:41:54,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:41:54" (1/1) ... [2024-10-24 18:41:54,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:41:55,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:41:55,395 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-24 18:41:55,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@46406a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:41:55, skipping insertion in model container [2024-10-24 18:41:55,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:41:55,397 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 18:41:55,399 INFO L158 Benchmark]: Toolchain (without parser) took 526.82ms. Allocated memory is still 230.7MB. Free memory was 157.8MB in the beginning and 139.3MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 18:41:55,404 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 99.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:41:55,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.45ms. Allocated memory is still 230.7MB. Free memory was 157.8MB in the beginning and 139.3MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 18:41:55,406 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.14ms. Allocated memory is still 134.2MB. Free memory is still 99.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.45ms. Allocated memory is still 230.7MB. Free memory was 157.8MB in the beginning and 139.3MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: 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_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:41:57,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:41:58,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 18:41:58,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:41:58,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:41:58,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:41:58,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:41:58,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:41:58,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:41:58,059 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:41:58,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:41:58,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:41:58,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:41:58,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:41:58,062 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:41:58,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:41:58,063 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 18:41:58,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:41:58,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 18:41:58,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:41:58,068 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:41:58,068 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:41:58,069 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:41:58,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:41:58,069 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:41:58,069 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 18:41:58,070 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:41:58,070 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 18:41:58,070 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:41:58,070 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 18:41:58,070 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:41:58,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:41:58,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:41:58,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:41:58,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:41:58,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:41:58,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:41:58,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:41:58,073 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 18:41:58,073 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 18:41:58,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:41:58,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:41:58,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:41:58,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:41:58,074 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 18:41:58,074 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 -> a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 [2024-10-24 18:41:58,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:41:58,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:41:58,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:41:58,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:41:58,514 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:41:58,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2024-10-24 18:42:00,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:42:00,649 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:42:00,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2024-10-24 18:42:00,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f40feada/7eec08a5a7f3438aabf1ef98c28461b7/FLAGeabc24a24 [2024-10-24 18:42:00,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f40feada/7eec08a5a7f3438aabf1ef98c28461b7 [2024-10-24 18:42:00,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:42:00,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:42:00,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:42:00,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:42:00,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:42:00,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:42:00" (1/1) ... [2024-10-24 18:42:00,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb711f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:00, skipping insertion in model container [2024-10-24 18:42:00,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:42:00" (1/1) ... [2024-10-24 18:42:00,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:42:01,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:42:01,327 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 18:42:01,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:42:01,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:42:01,383 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 18:42:01,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:42:01,493 INFO L204 MainTranslator]: Completed translation [2024-10-24 18:42:01,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:01 WrapperNode [2024-10-24 18:42:01,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:42:01,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 18:42:01,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 18:42:01,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 18:42:01,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:01" (1/1) ... [2024-10-24 18:42:01,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:01" (1/1) ... [2024-10-24 18:42:01,566 INFO L138 Inliner]: procedures = 179, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 640 [2024-10-24 18:42:01,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 18:42:01,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 18:42:01,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 18:42:01,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 18:42:01,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:01" (1/1) ... [2024-10-24 18:42:01,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:01" (1/1) ... [2024-10-24 18:42:01,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:01" (1/1) ... [2024-10-24 18:42:01,642 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-10-24 18:42:01,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:01" (1/1) ... [2024-10-24 18:42:01,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:01" (1/1) ... [2024-10-24 18:42:01,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:01" (1/1) ... [2024-10-24 18:42:01,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:01" (1/1) ... [2024-10-24 18:42:01,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:01" (1/1) ... [2024-10-24 18:42:01,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:01" (1/1) ... [2024-10-24 18:42:01,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 18:42:01,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 18:42:01,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 18:42:01,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 18:42:01,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:01" (1/1) ... [2024-10-24 18:42:01,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:42:01,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 18:42:01,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 18:42:01,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 18:42:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 18:42:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 18:42:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 18:42:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 18:42:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 18:42:01,816 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 18:42:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 18:42:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 18:42:01,816 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 18:42:01,816 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 18:42:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 18:42:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 18:42:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 18:42:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 18:42:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 18:42:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 18:42:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 18:42:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 18:42:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 18:42:01,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 18:42:01,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 18:42:01,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 18:42:01,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 18:42:02,034 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 18:42:02,036 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 18:42:02,041 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-24 18:42:02,104 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-24 18:42:04,009 INFO L? ?]: Removed 686 outVars from TransFormulas that were not future-live. [2024-10-24 18:42:04,010 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 18:42:04,114 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 18:42:04,115 INFO L314 CfgBuilder]: Removed 31 assume(true) statements. [2024-10-24 18:42:04,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:42:04 BoogieIcfgContainer [2024-10-24 18:42:04,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 18:42:04,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 18:42:04,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 18:42:04,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 18:42:04,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:42:00" (1/3) ... [2024-10-24 18:42:04,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a96d354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:42:04, skipping insertion in model container [2024-10-24 18:42:04,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:42:01" (2/3) ... [2024-10-24 18:42:04,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a96d354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:42:04, skipping insertion in model container [2024-10-24 18:42:04,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:42:04" (3/3) ... [2024-10-24 18:42:04,121 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test1-1.i [2024-10-24 18:42:04,133 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 18:42:04,133 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-10-24 18:42:04,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 18:42:04,194 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;@22d4b807, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 18:42:04,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-10-24 18:42:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 593 states, 260 states have (on average 2.5) internal successors, (650), 587 states have internal predecessors, (650), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 18:42:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 18:42:04,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:04,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 18:42:04,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:04,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:04,208 INFO L85 PathProgramCache]: Analyzing trace with hash 33095977, now seen corresponding path program 1 times [2024-10-24 18:42:04,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:04,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043139393] [2024-10-24 18:42:04,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:04,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:04,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:04,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:04,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 18:42:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:04,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:42:04,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:04,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 18:42:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:42:04,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:04,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043139393] [2024-10-24 18:42:04,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043139393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:04,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:04,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:42:04,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779008305] [2024-10-24 18:42:04,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:04,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:42:04,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:04,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:42:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:42:04,410 INFO L87 Difference]: Start difference. First operand has 593 states, 260 states have (on average 2.5) internal successors, (650), 587 states have internal predecessors, (650), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:05,445 INFO L93 Difference]: Finished difference Result 536 states and 583 transitions. [2024-10-24 18:42:05,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:42:05,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 18:42:05,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:05,469 INFO L225 Difference]: With dead ends: 536 [2024-10-24 18:42:05,469 INFO L226 Difference]: Without dead ends: 535 [2024-10-24 18:42:05,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:42:05,473 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 476 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:05,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 277 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 18:42:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-24 18:42:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 533. [2024-10-24 18:42:05,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 255 states have (on average 2.168627450980392) internal successors, (553), 527 states have internal predecessors, (553), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 18:42:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 579 transitions. [2024-10-24 18:42:05,522 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 579 transitions. Word has length 4 [2024-10-24 18:42:05,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:05,523 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 579 transitions. [2024-10-24 18:42:05,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:05,523 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 579 transitions. [2024-10-24 18:42:05,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 18:42:05,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:05,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 18:42:05,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 18:42:05,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:05,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:05,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:05,725 INFO L85 PathProgramCache]: Analyzing trace with hash 33095978, now seen corresponding path program 1 times [2024-10-24 18:42:05,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:05,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123528536] [2024-10-24 18:42:05,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:05,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:05,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:05,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:05,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 18:42:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:05,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:42:05,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:05,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 18:42:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:42:05,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:05,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:05,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123528536] [2024-10-24 18:42:05,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123528536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:05,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:05,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:42:05,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388387065] [2024-10-24 18:42:05,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:05,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:42:05,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:05,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:42:05,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:42:05,824 INFO L87 Difference]: Start difference. First operand 533 states and 579 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:06,793 INFO L93 Difference]: Finished difference Result 597 states and 647 transitions. [2024-10-24 18:42:06,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:42:06,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 18:42:06,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:06,798 INFO L225 Difference]: With dead ends: 597 [2024-10-24 18:42:06,798 INFO L226 Difference]: Without dead ends: 597 [2024-10-24 18:42:06,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:42:06,800 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 234 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:06,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 594 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 18:42:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-10-24 18:42:06,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 550. [2024-10-24 18:42:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 282 states have (on average 2.152482269503546) internal successors, (607), 544 states have internal predecessors, (607), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 18:42:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 633 transitions. [2024-10-24 18:42:06,824 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 633 transitions. Word has length 4 [2024-10-24 18:42:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:06,825 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 633 transitions. [2024-10-24 18:42:06,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 633 transitions. [2024-10-24 18:42:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 18:42:06,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:06,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 18:42:06,829 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-24 18:42:07,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:07,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:07,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:07,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1026781799, now seen corresponding path program 1 times [2024-10-24 18:42:07,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:07,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801681828] [2024-10-24 18:42:07,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:07,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:07,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:07,032 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:07,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 18:42:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:07,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:42:07,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:42:07,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:07,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:07,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801681828] [2024-10-24 18:42:07,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801681828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:07,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:07,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:42:07,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708230655] [2024-10-24 18:42:07,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:07,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:42:07,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:07,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:42:07,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:42:07,149 INFO L87 Difference]: Start difference. First operand 550 states and 633 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:07,773 INFO L93 Difference]: Finished difference Result 1056 states and 1202 transitions. [2024-10-24 18:42:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:42:07,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-24 18:42:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:07,778 INFO L225 Difference]: With dead ends: 1056 [2024-10-24 18:42:07,778 INFO L226 Difference]: Without dead ends: 1056 [2024-10-24 18:42:07,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:42:07,779 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 498 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:07,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1178 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 18:42:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2024-10-24 18:42:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 551. [2024-10-24 18:42:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 283 states have (on average 2.148409893992933) internal successors, (608), 545 states have internal predecessors, (608), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 18:42:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 634 transitions. [2024-10-24 18:42:07,793 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 634 transitions. Word has length 5 [2024-10-24 18:42:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:07,793 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 634 transitions. [2024-10-24 18:42:07,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 634 transitions. [2024-10-24 18:42:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 18:42:07,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:07,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:07,797 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 (4)] Ended with exit code 0 [2024-10-24 18:42:07,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:07,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:07,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1355304371, now seen corresponding path program 1 times [2024-10-24 18:42:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:07,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413862479] [2024-10-24 18:42:07,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:07,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:07,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:08,000 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:08,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 18:42:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:08,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:42:08,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:42:08,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:08,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:08,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413862479] [2024-10-24 18:42:08,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413862479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:08,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:08,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:42:08,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985099740] [2024-10-24 18:42:08,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:08,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:42:08,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:08,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:42:08,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:42:08,098 INFO L87 Difference]: Start difference. First operand 551 states and 634 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:08,523 INFO L93 Difference]: Finished difference Result 512 states and 594 transitions. [2024-10-24 18:42:08,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:42:08,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 18:42:08,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:08,526 INFO L225 Difference]: With dead ends: 512 [2024-10-24 18:42:08,527 INFO L226 Difference]: Without dead ends: 512 [2024-10-24 18:42:08,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:42:08,527 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 61 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:08,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 872 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 18:42:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-10-24 18:42:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2024-10-24 18:42:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 268 states have (on average 2.1194029850746268) internal successors, (568), 506 states have internal predecessors, (568), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 18:42:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 594 transitions. [2024-10-24 18:42:08,537 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 594 transitions. Word has length 10 [2024-10-24 18:42:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:08,537 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 594 transitions. [2024-10-24 18:42:08,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 594 transitions. [2024-10-24 18:42:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 18:42:08,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:08,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:08,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 18:42:08,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:08,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:08,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:08,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1072405965, now seen corresponding path program 1 times [2024-10-24 18:42:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:08,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049529942] [2024-10-24 18:42:08,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:08,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:08,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:08,743 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:08,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 18:42:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:08,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:42:08,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:42:08,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:08,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:08,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049529942] [2024-10-24 18:42:08,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049529942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:08,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:08,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:42:08,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230162755] [2024-10-24 18:42:08,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:08,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:42:08,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:08,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:42:08,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:42:08,869 INFO L87 Difference]: Start difference. First operand 512 states and 594 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:09,270 INFO L93 Difference]: Finished difference Result 497 states and 572 transitions. [2024-10-24 18:42:09,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:42:09,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-24 18:42:09,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:09,274 INFO L225 Difference]: With dead ends: 497 [2024-10-24 18:42:09,274 INFO L226 Difference]: Without dead ends: 497 [2024-10-24 18:42:09,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:42:09,275 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 45 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:09,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1260 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 18:42:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-24 18:42:09,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2024-10-24 18:42:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 267 states have (on average 2.044943820224719) internal successors, (546), 491 states have internal predecessors, (546), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 18:42:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 572 transitions. [2024-10-24 18:42:09,282 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 572 transitions. Word has length 12 [2024-10-24 18:42:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:09,282 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 572 transitions. [2024-10-24 18:42:09,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 572 transitions. [2024-10-24 18:42:09,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 18:42:09,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:09,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:09,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 18:42:09,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:09,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:09,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:09,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1380225925, now seen corresponding path program 1 times [2024-10-24 18:42:09,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:09,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242678991] [2024-10-24 18:42:09,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:09,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:09,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:09,490 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:09,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 (7)] Waiting until timeout for monitored process [2024-10-24 18:42:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:09,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:42:09,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:09,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 18:42:09,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:42:09,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:09,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:09,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242678991] [2024-10-24 18:42:09,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242678991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:09,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:09,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:42:09,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950071660] [2024-10-24 18:42:09,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:09,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:42:09,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:09,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:42:09,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:42:09,636 INFO L87 Difference]: Start difference. First operand 497 states and 572 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:10,581 INFO L93 Difference]: Finished difference Result 497 states and 572 transitions. [2024-10-24 18:42:10,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:42:10,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-24 18:42:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:10,584 INFO L225 Difference]: With dead ends: 497 [2024-10-24 18:42:10,584 INFO L226 Difference]: Without dead ends: 497 [2024-10-24 18:42:10,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:42:10,584 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 420 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:10,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 412 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 18:42:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-24 18:42:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 493. [2024-10-24 18:42:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 267 states have (on average 2.0299625468164795) internal successors, (542), 487 states have internal predecessors, (542), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 18:42:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 568 transitions. [2024-10-24 18:42:10,592 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 568 transitions. Word has length 26 [2024-10-24 18:42:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:10,592 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 568 transitions. [2024-10-24 18:42:10,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 568 transitions. [2024-10-24 18:42:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 18:42:10,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:10,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:10,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 18:42:10,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:10,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:10,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:10,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1380225924, now seen corresponding path program 1 times [2024-10-24 18:42:10,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:10,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639029862] [2024-10-24 18:42:10,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:10,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:10,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:10,797 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:10,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 18:42:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:10,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:42:10,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:10,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 18:42:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:42:11,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:11,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:11,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639029862] [2024-10-24 18:42:11,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639029862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:11,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:11,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:42:11,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138081911] [2024-10-24 18:42:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:11,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:42:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:11,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:42:11,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:42:11,025 INFO L87 Difference]: Start difference. First operand 493 states and 568 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:12,087 INFO L93 Difference]: Finished difference Result 540 states and 582 transitions. [2024-10-24 18:42:12,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:42:12,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-24 18:42:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:12,093 INFO L225 Difference]: With dead ends: 540 [2024-10-24 18:42:12,093 INFO L226 Difference]: Without dead ends: 540 [2024-10-24 18:42:12,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:42:12,094 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 174 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:12,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 760 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 18:42:12,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-10-24 18:42:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 489. [2024-10-24 18:42:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 267 states have (on average 2.0149812734082397) internal successors, (538), 483 states have internal predecessors, (538), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 18:42:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 564 transitions. [2024-10-24 18:42:12,113 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 564 transitions. Word has length 26 [2024-10-24 18:42:12,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:12,113 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 564 transitions. [2024-10-24 18:42:12,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:12,113 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 564 transitions. [2024-10-24 18:42:12,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 18:42:12,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:12,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:12,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 18:42:12,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:12,315 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:12,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1691675659, now seen corresponding path program 1 times [2024-10-24 18:42:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:12,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139808235] [2024-10-24 18:42:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:12,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:12,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:12,319 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:12,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 18:42:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:12,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:42:12,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:42:12,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:12,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:12,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139808235] [2024-10-24 18:42:12,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139808235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:12,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:12,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:42:12,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007065364] [2024-10-24 18:42:12,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:12,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:42:12,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:12,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:42:12,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:42:12,506 INFO L87 Difference]: Start difference. First operand 489 states and 564 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:12,873 INFO L93 Difference]: Finished difference Result 483 states and 554 transitions. [2024-10-24 18:42:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:42:12,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-24 18:42:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:12,875 INFO L225 Difference]: With dead ends: 483 [2024-10-24 18:42:12,875 INFO L226 Difference]: Without dead ends: 483 [2024-10-24 18:42:12,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:42:12,876 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 15 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:12,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1243 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 18:42:12,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-10-24 18:42:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2024-10-24 18:42:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 261 states have (on average 2.0229885057471266) internal successors, (528), 477 states have internal predecessors, (528), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 18:42:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 554 transitions. [2024-10-24 18:42:12,882 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 554 transitions. Word has length 42 [2024-10-24 18:42:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:12,883 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 554 transitions. [2024-10-24 18:42:12,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 554 transitions. [2024-10-24 18:42:12,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 18:42:12,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:12,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:12,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 18:42:13,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:13,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:13,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:13,088 INFO L85 PathProgramCache]: Analyzing trace with hash 489053462, now seen corresponding path program 1 times [2024-10-24 18:42:13,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:13,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945312359] [2024-10-24 18:42:13,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:13,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:13,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:13,092 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:13,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 18:42:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:13,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:42:13,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:42:13,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:13,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:13,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945312359] [2024-10-24 18:42:13,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945312359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:13,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:13,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:42:13,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775345154] [2024-10-24 18:42:13,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:13,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:42:13,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:13,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:42:13,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:42:13,391 INFO L87 Difference]: Start difference. First operand 483 states and 554 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:13,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:13,694 INFO L93 Difference]: Finished difference Result 526 states and 597 transitions. [2024-10-24 18:42:13,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:42:13,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-24 18:42:13,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:13,697 INFO L225 Difference]: With dead ends: 526 [2024-10-24 18:42:13,697 INFO L226 Difference]: Without dead ends: 526 [2024-10-24 18:42:13,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:42:13,698 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 0 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:13,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 843 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 18:42:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-24 18:42:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-24 18:42:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 304 states have (on average 1.8782894736842106) internal successors, (571), 520 states have internal predecessors, (571), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 18:42:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 597 transitions. [2024-10-24 18:42:13,704 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 597 transitions. Word has length 46 [2024-10-24 18:42:13,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:13,705 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 597 transitions. [2024-10-24 18:42:13,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 597 transitions. [2024-10-24 18:42:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 18:42:13,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:13,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:13,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-24 18:42:13,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:13,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:13,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:13,910 INFO L85 PathProgramCache]: Analyzing trace with hash 755145577, now seen corresponding path program 1 times [2024-10-24 18:42:13,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:13,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839147381] [2024-10-24 18:42:13,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:13,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:13,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:13,913 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:13,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 18:42:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:14,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 18:42:14,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:14,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 18:42:14,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 18:42:14,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:42:14,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 18:42:14,411 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 18:42:14,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 18:42:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:42:14,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:14,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:14,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839147381] [2024-10-24 18:42:14,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839147381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:14,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:14,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:42:14,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178268959] [2024-10-24 18:42:14,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:14,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:42:14,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:14,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:42:14,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:42:14,424 INFO L87 Difference]: Start difference. First operand 526 states and 597 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:15,121 INFO L93 Difference]: Finished difference Result 488 states and 559 transitions. [2024-10-24 18:42:15,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:42:15,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-24 18:42:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:15,123 INFO L225 Difference]: With dead ends: 488 [2024-10-24 18:42:15,123 INFO L226 Difference]: Without dead ends: 488 [2024-10-24 18:42:15,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:42:15,124 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 331 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:15,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 243 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 18:42:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-24 18:42:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 461. [2024-10-24 18:42:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 277 states have (on average 1.6931407942238268) internal successors, (469), 455 states have internal predecessors, (469), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 18:42:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 495 transitions. [2024-10-24 18:42:15,130 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 495 transitions. Word has length 49 [2024-10-24 18:42:15,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:15,130 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 495 transitions. [2024-10-24 18:42:15,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 495 transitions. [2024-10-24 18:42:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 18:42:15,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:15,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:15,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-24 18:42:15,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:15,335 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:15,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1764703016, now seen corresponding path program 1 times [2024-10-24 18:42:15,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:15,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228622859] [2024-10-24 18:42:15,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:15,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:15,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:15,339 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:15,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 18:42:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:15,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 18:42:15,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:15,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 18:42:15,507 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-24 18:42:15,520 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-24 18:42:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:42:15,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:15,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:15,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228622859] [2024-10-24 18:42:15,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228622859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:15,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:15,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:42:15,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717317230] [2024-10-24 18:42:15,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:15,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:42:15,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:15,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:42:15,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:42:15,528 INFO L87 Difference]: Start difference. First operand 461 states and 495 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:16,525 INFO L93 Difference]: Finished difference Result 460 states and 494 transitions. [2024-10-24 18:42:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:42:16,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-24 18:42:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:16,529 INFO L225 Difference]: With dead ends: 460 [2024-10-24 18:42:16,529 INFO L226 Difference]: Without dead ends: 460 [2024-10-24 18:42:16,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:42:16,530 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 2 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:16,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1051 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 18:42:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-24 18:42:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2024-10-24 18:42:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 277 states have (on average 1.6895306859205776) internal successors, (468), 454 states have internal predecessors, (468), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 18:42:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 494 transitions. [2024-10-24 18:42:16,537 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 494 transitions. Word has length 53 [2024-10-24 18:42:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:16,537 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 494 transitions. [2024-10-24 18:42:16,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 494 transitions. [2024-10-24 18:42:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 18:42:16,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:16,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:16,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-24 18:42:16,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:16,743 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:16,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:16,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1764703015, now seen corresponding path program 1 times [2024-10-24 18:42:16,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:16,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283131407] [2024-10-24 18:42:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:16,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:16,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:16,745 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:16,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 18:42:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:16,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 18:42:16,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:16,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 18:42:16,934 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-24 18:42:16,941 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-24 18:42:16,978 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-24 18:42:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:42:16,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:16,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:16,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283131407] [2024-10-24 18:42:16,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283131407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:16,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:16,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:42:16,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124953912] [2024-10-24 18:42:16,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:16,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:42:16,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:16,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:42:16,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:42:16,995 INFO L87 Difference]: Start difference. First operand 460 states and 494 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:18,699 INFO L93 Difference]: Finished difference Result 459 states and 493 transitions. [2024-10-24 18:42:18,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:42:18,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-24 18:42:18,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:18,703 INFO L225 Difference]: With dead ends: 459 [2024-10-24 18:42:18,703 INFO L226 Difference]: Without dead ends: 459 [2024-10-24 18:42:18,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:42:18,703 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 1 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:18,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1058 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 18:42:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-24 18:42:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2024-10-24 18:42:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 276 states have (on average 1.6920289855072463) internal successors, (467), 453 states have internal predecessors, (467), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 18:42:18,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 493 transitions. [2024-10-24 18:42:18,712 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 493 transitions. Word has length 53 [2024-10-24 18:42:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:18,712 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 493 transitions. [2024-10-24 18:42:18,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:42:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 493 transitions. [2024-10-24 18:42:18,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 18:42:18,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:18,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:18,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-24 18:42:18,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:18,915 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:18,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -783569796, now seen corresponding path program 1 times [2024-10-24 18:42:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:18,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136721303] [2024-10-24 18:42:18,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:18,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:18,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:18,920 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:18,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 (14)] Waiting until timeout for monitored process [2024-10-24 18:42:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:19,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:42:19,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:42:19,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:42:19,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:19,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136721303] [2024-10-24 18:42:19,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136721303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:42:19,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:42:19,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:42:19,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96195273] [2024-10-24 18:42:19,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:42:19,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:42:19,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:19,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:42:19,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:42:19,193 INFO L87 Difference]: Start difference. First operand 459 states and 493 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:42:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:19,784 INFO L93 Difference]: Finished difference Result 461 states and 496 transitions. [2024-10-24 18:42:19,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:42:19,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-10-24 18:42:19,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:19,790 INFO L225 Difference]: With dead ends: 461 [2024-10-24 18:42:19,791 INFO L226 Difference]: Without dead ends: 461 [2024-10-24 18:42:19,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:42:19,792 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 0 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:19,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1179 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 18:42:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-10-24 18:42:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2024-10-24 18:42:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 277 states have (on average 1.6931407942238268) internal successors, (469), 455 states have internal predecessors, (469), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-24 18:42:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 496 transitions. [2024-10-24 18:42:19,801 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 496 transitions. Word has length 59 [2024-10-24 18:42:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:19,802 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 496 transitions. [2024-10-24 18:42:19,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:42:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 496 transitions. [2024-10-24 18:42:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 18:42:19,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:19,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:19,818 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-24 18:42:20,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:20,004 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:20,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1928290017, now seen corresponding path program 1 times [2024-10-24 18:42:20,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:20,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047515803] [2024-10-24 18:42:20,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:42:20,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:20,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:20,008 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:20,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-24 18:42:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:42:20,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:42:20,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:20,356 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-24 18:42:20,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:42:20,472 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-24 18:42:20,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:20,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047515803] [2024-10-24 18:42:20,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047515803] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:42:20,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:42:20,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 18:42:20,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323958144] [2024-10-24 18:42:20,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:42:20,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 18:42:20,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:20,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 18:42:20,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:42:20,475 INFO L87 Difference]: Start difference. First operand 461 states and 496 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:42:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:21,464 INFO L93 Difference]: Finished difference Result 470 states and 510 transitions. [2024-10-24 18:42:21,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 18:42:21,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2024-10-24 18:42:21,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:21,475 INFO L225 Difference]: With dead ends: 470 [2024-10-24 18:42:21,476 INFO L226 Difference]: Without dead ends: 470 [2024-10-24 18:42:21,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-24 18:42:21,476 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 5 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:21,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1568 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 18:42:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-24 18:42:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 469. [2024-10-24 18:42:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 284 states have (on average 1.6971830985915493) internal successors, (482), 462 states have internal predecessors, (482), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-24 18:42:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 509 transitions. [2024-10-24 18:42:21,503 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 509 transitions. Word has length 60 [2024-10-24 18:42:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:21,503 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 509 transitions. [2024-10-24 18:42:21,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:42:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 509 transitions. [2024-10-24 18:42:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 18:42:21,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:21,504 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:21,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-24 18:42:21,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:21,705 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:21,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:21,705 INFO L85 PathProgramCache]: Analyzing trace with hash -170418756, now seen corresponding path program 2 times [2024-10-24 18:42:21,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:21,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946873618] [2024-10-24 18:42:21,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 18:42:21,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:21,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:21,710 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:21,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-24 18:42:22,140 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 18:42:22,140 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:42:22,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 18:42:22,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:22,211 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-24 18:42:22,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:42:22,349 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-24 18:42:22,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:22,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946873618] [2024-10-24 18:42:22,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946873618] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:42:22,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:42:22,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 18:42:22,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956151531] [2024-10-24 18:42:22,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:42:22,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 18:42:22,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:22,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 18:42:22,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 18:42:22,353 INFO L87 Difference]: Start difference. First operand 469 states and 509 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:42:23,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:23,904 INFO L93 Difference]: Finished difference Result 481 states and 528 transitions. [2024-10-24 18:42:23,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 18:42:23,907 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2024-10-24 18:42:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:23,909 INFO L225 Difference]: With dead ends: 481 [2024-10-24 18:42:23,910 INFO L226 Difference]: Without dead ends: 479 [2024-10-24 18:42:23,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-24 18:42:23,912 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 8 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:23,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2744 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 18:42:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-24 18:42:23,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 478. [2024-10-24 18:42:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 293 states have (on average 1.6860068259385665) internal successors, (494), 471 states have internal predecessors, (494), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-24 18:42:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 521 transitions. [2024-10-24 18:42:23,928 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 521 transitions. Word has length 63 [2024-10-24 18:42:23,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:23,929 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 521 transitions. [2024-10-24 18:42:23,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:42:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 521 transitions. [2024-10-24 18:42:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 18:42:23,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:23,930 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:23,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-24 18:42:24,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:24,132 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:24,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:24,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2126027676, now seen corresponding path program 3 times [2024-10-24 18:42:24,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:24,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516649015] [2024-10-24 18:42:24,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 18:42:24,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:24,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:24,136 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:24,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-24 18:42:24,880 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-24 18:42:24,881 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:42:24,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 18:42:24,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:25,110 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-24 18:42:25,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:42:25,831 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-24 18:42:25,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:25,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516649015] [2024-10-24 18:42:25,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516649015] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:42:25,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:42:25,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 18:42:25,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618433955] [2024-10-24 18:42:25,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:42:25,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 18:42:25,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:25,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 18:42:25,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-24 18:42:25,838 INFO L87 Difference]: Start difference. First operand 478 states and 521 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:42:30,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:30,040 INFO L93 Difference]: Finished difference Result 499 states and 557 transitions. [2024-10-24 18:42:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 18:42:30,040 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-10-24 18:42:30,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:30,042 INFO L225 Difference]: With dead ends: 499 [2024-10-24 18:42:30,042 INFO L226 Difference]: Without dead ends: 496 [2024-10-24 18:42:30,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 18:42:30,044 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 14 mSDsluCounter, 4310 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4703 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:30,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4703 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 18:42:30,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-24 18:42:30,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2024-10-24 18:42:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 311 states have (on average 1.662379421221865) internal successors, (517), 489 states have internal predecessors, (517), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-24 18:42:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 544 transitions. [2024-10-24 18:42:30,072 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 544 transitions. Word has length 69 [2024-10-24 18:42:30,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:30,073 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 544 transitions. [2024-10-24 18:42:30,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:42:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 544 transitions. [2024-10-24 18:42:30,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 18:42:30,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:30,077 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:30,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-24 18:42:30,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:30,278 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:30,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash 445570908, now seen corresponding path program 4 times [2024-10-24 18:42:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:30,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232304841] [2024-10-24 18:42:30,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 18:42:30,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:30,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:30,288 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:30,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-24 18:42:31,057 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 18:42:31,057 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:42:31,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 18:42:31,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:31,501 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-24 18:42:31,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:42:32,914 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-24 18:42:32,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:32,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232304841] [2024-10-24 18:42:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232304841] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:42:32,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:42:32,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-24 18:42:32,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405757000] [2024-10-24 18:42:32,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:42:32,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 18:42:32,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:42:32,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 18:42:32,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 18:42:32,918 INFO L87 Difference]: Start difference. First operand 496 states and 544 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:42:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:42:42,667 INFO L93 Difference]: Finished difference Result 533 states and 613 transitions. [2024-10-24 18:42:42,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-24 18:42:42,669 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-10-24 18:42:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:42:42,671 INFO L225 Difference]: With dead ends: 533 [2024-10-24 18:42:42,671 INFO L226 Difference]: Without dead ends: 531 [2024-10-24 18:42:42,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-24 18:42:42,674 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 26 mSDsluCounter, 9407 mSDsCounter, 0 mSdLazyCounter, 3181 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9800 SdHoareTripleChecker+Invalid, 3243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-24 18:42:42,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9800 Invalid, 3243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 3181 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-24 18:42:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-24 18:42:42,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 530. [2024-10-24 18:42:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 345 states have (on average 1.6318840579710145) internal successors, (563), 523 states have internal predecessors, (563), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-24 18:42:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 590 transitions. [2024-10-24 18:42:42,684 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 590 transitions. Word has length 81 [2024-10-24 18:42:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:42:42,685 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 590 transitions. [2024-10-24 18:42:42,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:42:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 590 transitions. [2024-10-24 18:42:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 18:42:42,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:42:42,686 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:42:42,701 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 (18)] Ended with exit code 0 [2024-10-24 18:42:42,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:42,888 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-24 18:42:42,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:42:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1525066300, now seen corresponding path program 5 times [2024-10-24 18:42:42,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:42:42,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822175101] [2024-10-24 18:42:42,891 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-24 18:42:42,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:42:42,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:42:42,894 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:42:42,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-24 18:42:44,490 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-24 18:42:44,490 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:42:44,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-24 18:42:44,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:42:44,551 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-24 18:42:44,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-10-24 18:42:44,916 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-10-24 18:42:44,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-10-24 18:42:44,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 18:42:45,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2024-10-24 18:42:48,054 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-24 18:42:48,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-10-24 18:42:48,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-10-24 18:42:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-24 18:42:48,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:42:48,637 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1648) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2024-10-24 18:42:48,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:42:48,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822175101] [2024-10-24 18:42:48,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822175101] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 18:42:48,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1200919647] [2024-10-24 18:42:48,640 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-24 18:42:48,640 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 18:42:48,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 18:42:48,647 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 18:42:48,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process