./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2bb9f0c15e3c3296f863c26b4377b27546cf1c417a60e9663a6ff48eb617ef8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:22:13,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:22:13,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:22:13,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:22:13,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:22:13,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:22:13,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:22:13,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:22:13,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:22:13,305 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:22:13,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:22:13,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:22:13,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:22:13,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:22:13,307 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:22:13,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:22:13,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:22:13,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:22:13,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:22:13,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:22:13,308 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:22:13,309 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:22:13,309 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:22:13,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:22:13,310 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:22:13,310 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:22:13,310 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:22:13,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:22:13,311 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:22:13,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:22:13,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:22:13,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:22:13,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:22:13,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:22:13,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:22:13,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:22:13,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:22:13,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:22:13,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:22:13,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:22:13,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:22:13,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:22:13,314 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2bb9f0c15e3c3296f863c26b4377b27546cf1c417a60e9663a6ff48eb617ef8 [2024-10-11 19:22:13,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:22:13,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:22:13,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:22:13,537 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:22:13,537 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:22:13,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i [2024-10-11 19:22:14,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:22:15,124 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:22:15,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i [2024-10-11 19:22:15,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/462ee0a6a/77778d645f8a4bf099ee75294fb17104/FLAGd970bb6c3 [2024-10-11 19:22:15,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/462ee0a6a/77778d645f8a4bf099ee75294fb17104 [2024-10-11 19:22:15,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:22:15,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:22:15,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:22:15,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:22:15,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:22:15,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:22:15" (1/1) ... [2024-10-11 19:22:15,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e8ab7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:15, skipping insertion in model container [2024-10-11 19:22:15,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:22:15" (1/1) ... [2024-10-11 19:22:15,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:22:15,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:22:15,641 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 19:22:15,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@33b2700c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:15, skipping insertion in model container [2024-10-11 19:22:15,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:22:15,642 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:22:15,644 INFO L158 Benchmark]: Toolchain (without parser) took 482.19ms. Allocated memory is still 161.5MB. Free memory was 87.9MB in the beginning and 121.8MB in the end (delta: -33.9MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-10-11 19:22:15,645 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 161.5MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:22:15,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.83ms. Allocated memory is still 161.5MB. Free memory was 87.5MB in the beginning and 121.8MB in the end (delta: -34.3MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-10-11 19:22:15,647 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.15ms. Allocated memory is still 161.5MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.83ms. Allocated memory is still 161.5MB. Free memory was 87.5MB in the beginning and 121.8MB in the end (delta: -34.3MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 716]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2bb9f0c15e3c3296f863c26b4377b27546cf1c417a60e9663a6ff48eb617ef8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:22:17,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:22:17,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:22:17,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:22:17,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:22:17,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:22:17,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:22:17,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:22:17,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:22:17,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:22:17,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:22:17,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:22:17,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:22:17,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:22:17,680 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:22:17,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:22:17,681 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:22:17,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:22:17,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:22:17,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:22:17,686 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:22:17,686 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:22:17,686 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:22:17,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:22:17,687 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:22:17,687 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:22:17,688 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:22:17,688 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:22:17,688 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:22:17,688 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:22:17,689 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:22:17,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:22:17,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:22:17,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:22:17,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:22:17,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:22:17,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:22:17,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:22:17,691 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:22:17,691 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:22:17,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:22:17,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:22:17,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:22:17,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:22:17,692 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:22:17,692 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2bb9f0c15e3c3296f863c26b4377b27546cf1c417a60e9663a6ff48eb617ef8 [2024-10-11 19:22:17,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:22:18,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:22:18,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:22:18,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:22:18,011 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:22:18,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i [2024-10-11 19:22:19,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:22:19,684 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:22:19,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i [2024-10-11 19:22:19,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7e709d14a/b522dbc96f1d47dcb45d4aa7fce411b3/FLAGb9b9d12dd [2024-10-11 19:22:19,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7e709d14a/b522dbc96f1d47dcb45d4aa7fce411b3 [2024-10-11 19:22:19,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:22:19,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:22:19,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:22:19,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:22:19,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:22:19,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:22:19" (1/1) ... [2024-10-11 19:22:19,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ccfcf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19, skipping insertion in model container [2024-10-11 19:22:19,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:22:19" (1/1) ... [2024-10-11 19:22:19,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:22:20,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:22:20,249 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:22:20,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:22:20,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:22:20,355 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:22:20,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:22:20,461 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:22:20,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:20 WrapperNode [2024-10-11 19:22:20,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:22:20,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:22:20,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:22:20,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:22:20,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:20" (1/1) ... [2024-10-11 19:22:20,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:20" (1/1) ... [2024-10-11 19:22:20,567 INFO L138 Inliner]: procedures = 179, calls = 272, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1037 [2024-10-11 19:22:20,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:22:20,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:22:20,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:22:20,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:22:20,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:20" (1/1) ... [2024-10-11 19:22:20,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:20" (1/1) ... [2024-10-11 19:22:20,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:20" (1/1) ... [2024-10-11 19:22:20,674 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 217, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-10-11 19:22:20,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:20" (1/1) ... [2024-10-11 19:22:20,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:20" (1/1) ... [2024-10-11 19:22:20,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:20" (1/1) ... [2024-10-11 19:22:20,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:20" (1/1) ... [2024-10-11 19:22:20,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:20" (1/1) ... [2024-10-11 19:22:20,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:20" (1/1) ... [2024-10-11 19:22:20,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:22:20,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:22:20,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:22:20,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:22:20,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:20" (1/1) ... [2024-10-11 19:22:20,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:22:20,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:22:20,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:22:20,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:22:20,802 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 19:22:20,802 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 19:22:20,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:22:20,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:22:20,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 19:22:20,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:22:20,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:22:20,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:22:20,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:22:20,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:22:20,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 19:22:20,804 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:22:20,804 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:22:20,804 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 19:22:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:22:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:22:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:22:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:22:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:22:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:22:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:22:20,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:22:20,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:22:20,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:22:20,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:22:20,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:22:20,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:22:20,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:22:20,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:22:20,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:22:20,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:22:20,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:22:20,976 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:22:20,980 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:22:21,000 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:22:21,031 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:22:21,053 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:22:23,861 INFO L? ?]: Removed 1074 outVars from TransFormulas that were not future-live. [2024-10-11 19:22:23,861 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:22:23,990 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:22:23,990 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-11 19:22:23,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:22:23 BoogieIcfgContainer [2024-10-11 19:22:23,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:22:23,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:22:23,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:22:23,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:22:23,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:22:19" (1/3) ... [2024-10-11 19:22:23,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378b7646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:22:23, skipping insertion in model container [2024-10-11 19:22:23,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:20" (2/3) ... [2024-10-11 19:22:23,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378b7646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:22:23, skipping insertion in model container [2024-10-11 19:22:23,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:22:23" (3/3) ... [2024-10-11 19:22:23,998 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test7-1.i [2024-10-11 19:22:24,012 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:22:24,012 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 523 error locations. [2024-10-11 19:22:24,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:22:24,074 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;@5c5aebbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:22:24,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 523 error locations. [2024-10-11 19:22:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 950 states, 422 states have (on average 2.523696682464455) internal successors, (1065), 943 states have internal predecessors, (1065), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 19:22:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:22:24,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:24,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:22:24,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:24,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:24,090 INFO L85 PathProgramCache]: Analyzing trace with hash 54073, now seen corresponding path program 1 times [2024-10-11 19:22:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:24,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782858120] [2024-10-11 19:22:24,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:24,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:24,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:24,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:24,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 19:22:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:24,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:22:24,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:24,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:22:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:24,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:24,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:24,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782858120] [2024-10-11 19:22:24,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782858120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:24,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:24,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:22:24,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773548682] [2024-10-11 19:22:24,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:24,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:22:24,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:24,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:22:24,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:24,370 INFO L87 Difference]: Start difference. First operand has 950 states, 422 states have (on average 2.523696682464455) internal successors, (1065), 943 states have internal predecessors, (1065), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:25,649 INFO L93 Difference]: Finished difference Result 942 states and 998 transitions. [2024-10-11 19:22:25,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:22:25,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-11 19:22:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:25,667 INFO L225 Difference]: With dead ends: 942 [2024-10-11 19:22:25,668 INFO L226 Difference]: Without dead ends: 941 [2024-10-11 19:22:25,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:25,678 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 867 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:25,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 558 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:22:25,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-10-11 19:22:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 933. [2024-10-11 19:22:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 424 states have (on average 2.313679245283019) internal successors, (981), 927 states have internal predecessors, (981), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 989 transitions. [2024-10-11 19:22:25,759 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 989 transitions. Word has length 2 [2024-10-11 19:22:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:25,759 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 989 transitions. [2024-10-11 19:22:25,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 989 transitions. [2024-10-11 19:22:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:22:25,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:25,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:22:25,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 19:22:25,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:25,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:25,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:25,966 INFO L85 PathProgramCache]: Analyzing trace with hash 54074, now seen corresponding path program 1 times [2024-10-11 19:22:25,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:25,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104087112] [2024-10-11 19:22:25,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:25,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:25,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:25,968 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:25,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 19:22:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:26,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:22:26,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:26,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:22:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:26,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:26,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:26,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104087112] [2024-10-11 19:22:26,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104087112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:26,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:26,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:22:26,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371810197] [2024-10-11 19:22:26,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:26,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:22:26,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:26,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:22:26,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:26,105 INFO L87 Difference]: Start difference. First operand 933 states and 989 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:28,208 INFO L93 Difference]: Finished difference Result 1294 states and 1382 transitions. [2024-10-11 19:22:28,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:22:28,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-11 19:22:28,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:28,212 INFO L225 Difference]: With dead ends: 1294 [2024-10-11 19:22:28,212 INFO L226 Difference]: Without dead ends: 1294 [2024-10-11 19:22:28,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:28,213 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 390 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:28,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1198 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 19:22:28,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-10-11 19:22:28,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1106. [2024-10-11 19:22:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 598 states have (on average 2.2876254180602005) internal successors, (1368), 1100 states have internal predecessors, (1368), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1376 transitions. [2024-10-11 19:22:28,234 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1376 transitions. Word has length 2 [2024-10-11 19:22:28,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:28,234 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1376 transitions. [2024-10-11 19:22:28,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1376 transitions. [2024-10-11 19:22:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 19:22:28,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:28,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:22:28,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 19:22:28,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:28,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:28,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:28,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1601587645, now seen corresponding path program 1 times [2024-10-11 19:22:28,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:28,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009106421] [2024-10-11 19:22:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:28,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:28,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:28,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:28,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 19:22:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:28,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:22:28,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:28,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:22:28,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:22:28,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:22:28,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:22:28,699 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:22:28,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:22:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:28,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:28,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:28,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009106421] [2024-10-11 19:22:28,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009106421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:28,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:28,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:22:28,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242816657] [2024-10-11 19:22:28,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:28,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:28,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:28,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:28,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:28,742 INFO L87 Difference]: Start difference. First operand 1106 states and 1376 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:30,563 INFO L93 Difference]: Finished difference Result 1108 states and 1380 transitions. [2024-10-11 19:22:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:30,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 19:22:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:30,567 INFO L225 Difference]: With dead ends: 1108 [2024-10-11 19:22:30,567 INFO L226 Difference]: Without dead ends: 1108 [2024-10-11 19:22:30,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:30,568 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1816 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:30,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 281 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 19:22:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2024-10-11 19:22:30,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 921. [2024-10-11 19:22:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 424 states have (on average 2.2830188679245285) internal successors, (968), 915 states have internal predecessors, (968), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 976 transitions. [2024-10-11 19:22:30,580 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 976 transitions. Word has length 6 [2024-10-11 19:22:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:30,581 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 976 transitions. [2024-10-11 19:22:30,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 976 transitions. [2024-10-11 19:22:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:22:30,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:30,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:30,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 19:22:30,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:30,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:30,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:30,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1890390559, now seen corresponding path program 1 times [2024-10-11 19:22:30,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:30,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303102704] [2024-10-11 19:22:30,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:30,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:30,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:30,790 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:30,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 19:22:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:30,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:22:30,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:30,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:22:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:30,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:30,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:30,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303102704] [2024-10-11 19:22:30,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303102704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:30,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:30,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:22:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411055058] [2024-10-11 19:22:30,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:30,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:22:30,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:22:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:30,944 INFO L87 Difference]: Start difference. First operand 921 states and 976 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:32,958 INFO L93 Difference]: Finished difference Result 1344 states and 1436 transitions. [2024-10-11 19:22:32,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:22:32,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 19:22:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:32,963 INFO L225 Difference]: With dead ends: 1344 [2024-10-11 19:22:32,963 INFO L226 Difference]: Without dead ends: 1344 [2024-10-11 19:22:32,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:32,964 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 623 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:32,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1302 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 19:22:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2024-10-11 19:22:32,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 938. [2024-10-11 19:22:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 451 states have (on average 2.2749445676274944) internal successors, (1026), 932 states have internal predecessors, (1026), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:32,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1034 transitions. [2024-10-11 19:22:32,982 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1034 transitions. Word has length 7 [2024-10-11 19:22:32,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:32,983 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1034 transitions. [2024-10-11 19:22:32,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:32,983 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1034 transitions. [2024-10-11 19:22:32,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:22:32,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:32,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:32,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 19:22:33,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:33,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:33,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:33,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1890390558, now seen corresponding path program 1 times [2024-10-11 19:22:33,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:33,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851292617] [2024-10-11 19:22:33,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:33,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:33,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:33,194 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:33,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 19:22:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:33,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:22:33,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:33,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:22:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:33,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:33,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:33,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851292617] [2024-10-11 19:22:33,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851292617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:33,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:33,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:22:33,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676005942] [2024-10-11 19:22:33,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:33,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:22:33,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:33,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:22:33,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:33,297 INFO L87 Difference]: Start difference. First operand 938 states and 1034 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:34,815 INFO L93 Difference]: Finished difference Result 1239 states and 1361 transitions. [2024-10-11 19:22:34,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:22:34,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 19:22:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:34,819 INFO L225 Difference]: With dead ends: 1239 [2024-10-11 19:22:34,819 INFO L226 Difference]: Without dead ends: 1239 [2024-10-11 19:22:34,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:34,821 INFO L432 NwaCegarLoop]: 768 mSDtfsCounter, 830 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:34,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 973 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:22:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2024-10-11 19:22:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 891. [2024-10-11 19:22:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 451 states have (on average 2.161862527716186) internal successors, (975), 885 states have internal predecessors, (975), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 983 transitions. [2024-10-11 19:22:34,845 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 983 transitions. Word has length 7 [2024-10-11 19:22:34,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:34,845 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 983 transitions. [2024-10-11 19:22:34,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 983 transitions. [2024-10-11 19:22:34,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 19:22:34,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:34,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:34,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 19:22:35,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:35,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr521ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:35,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:35,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1812468573, now seen corresponding path program 1 times [2024-10-11 19:22:35,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:35,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884535417] [2024-10-11 19:22:35,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:35,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:35,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:35,056 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:35,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 19:22:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:35,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:22:35,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:35,222 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:22:35,223 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:22:35,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-11 19:22:35,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:22:35,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2024-10-11 19:22:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:35,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:35,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:35,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884535417] [2024-10-11 19:22:35,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884535417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:35,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:35,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:35,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096616815] [2024-10-11 19:22:35,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:35,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:35,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:35,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:35,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:35,337 INFO L87 Difference]: Start difference. First operand 891 states and 983 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:37,026 INFO L93 Difference]: Finished difference Result 1769 states and 1956 transitions. [2024-10-11 19:22:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:37,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-10-11 19:22:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:37,031 INFO L225 Difference]: With dead ends: 1769 [2024-10-11 19:22:37,032 INFO L226 Difference]: Without dead ends: 1769 [2024-10-11 19:22:37,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:37,032 INFO L432 NwaCegarLoop]: 790 mSDtfsCounter, 888 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:37,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 2363 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 19:22:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2024-10-11 19:22:37,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 893. [2024-10-11 19:22:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 453 states have (on average 2.1567328918322297) internal successors, (977), 887 states have internal predecessors, (977), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 985 transitions. [2024-10-11 19:22:37,048 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 985 transitions. Word has length 11 [2024-10-11 19:22:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:37,048 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 985 transitions. [2024-10-11 19:22:37,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 985 transitions. [2024-10-11 19:22:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 19:22:37,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:37,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:37,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 19:22:37,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:37,250 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:37,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:37,250 INFO L85 PathProgramCache]: Analyzing trace with hash -289986667, now seen corresponding path program 1 times [2024-10-11 19:22:37,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:37,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447867359] [2024-10-11 19:22:37,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:37,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:37,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:37,255 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:37,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 19:22:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:37,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:22:37,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:37,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:37,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:37,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447867359] [2024-10-11 19:22:37,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447867359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:37,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:37,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:22:37,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128604155] [2024-10-11 19:22:37,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:37,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:22:37,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:37,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:22:37,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:37,408 INFO L87 Difference]: Start difference. First operand 893 states and 985 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:37,943 INFO L93 Difference]: Finished difference Result 854 states and 945 transitions. [2024-10-11 19:22:37,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:22:37,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 19:22:37,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:37,946 INFO L225 Difference]: With dead ends: 854 [2024-10-11 19:22:37,946 INFO L226 Difference]: Without dead ends: 854 [2024-10-11 19:22:37,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:37,947 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 61 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:37,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1482 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:22:37,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-10-11 19:22:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2024-10-11 19:22:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 438 states have (on average 2.1392694063926943) internal successors, (937), 848 states have internal predecessors, (937), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 945 transitions. [2024-10-11 19:22:37,958 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 945 transitions. Word has length 15 [2024-10-11 19:22:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:37,958 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 945 transitions. [2024-10-11 19:22:37,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 945 transitions. [2024-10-11 19:22:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 19:22:37,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:37,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:37,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 19:22:38,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:38,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:38,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:38,160 INFO L85 PathProgramCache]: Analyzing trace with hash 495684495, now seen corresponding path program 1 times [2024-10-11 19:22:38,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:38,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916731401] [2024-10-11 19:22:38,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:38,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:38,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:38,166 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:38,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 19:22:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:38,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:22:38,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:38,311 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:38,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:38,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916731401] [2024-10-11 19:22:38,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916731401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:38,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:38,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:38,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009822652] [2024-10-11 19:22:38,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:38,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:38,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:38,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:38,313 INFO L87 Difference]: Start difference. First operand 854 states and 945 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:39,093 INFO L93 Difference]: Finished difference Result 839 states and 923 transitions. [2024-10-11 19:22:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:22:39,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 19:22:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:39,097 INFO L225 Difference]: With dead ends: 839 [2024-10-11 19:22:39,097 INFO L226 Difference]: Without dead ends: 839 [2024-10-11 19:22:39,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:39,097 INFO L432 NwaCegarLoop]: 731 mSDtfsCounter, 45 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:39,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2175 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:22:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-10-11 19:22:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2024-10-11 19:22:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 437 states have (on average 2.0938215102974826) internal successors, (915), 833 states have internal predecessors, (915), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 923 transitions. [2024-10-11 19:22:39,108 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 923 transitions. Word has length 17 [2024-10-11 19:22:39,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:39,109 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 923 transitions. [2024-10-11 19:22:39,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 923 transitions. [2024-10-11 19:22:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 19:22:39,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:39,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:39,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 19:22:39,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:39,311 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:39,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1089062237, now seen corresponding path program 1 times [2024-10-11 19:22:39,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:39,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332392818] [2024-10-11 19:22:39,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:39,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:39,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:39,315 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:39,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 19:22:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:39,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:22:39,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:39,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:22:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:39,648 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:39,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:39,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332392818] [2024-10-11 19:22:39,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332392818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:39,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:39,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:22:39,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093134003] [2024-10-11 19:22:39,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:39,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:39,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:39,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:39,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:39,649 INFO L87 Difference]: Start difference. First operand 839 states and 923 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:41,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:41,179 INFO L93 Difference]: Finished difference Result 1184 states and 1297 transitions. [2024-10-11 19:22:41,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:41,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-11 19:22:41,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:41,182 INFO L225 Difference]: With dead ends: 1184 [2024-10-11 19:22:41,182 INFO L226 Difference]: Without dead ends: 1184 [2024-10-11 19:22:41,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:41,183 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 772 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:41,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 954 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:22:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2024-10-11 19:22:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 835. [2024-10-11 19:22:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 437 states have (on average 2.0846681922196795) internal successors, (911), 829 states have internal predecessors, (911), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 919 transitions. [2024-10-11 19:22:41,217 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 919 transitions. Word has length 31 [2024-10-11 19:22:41,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:41,217 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 919 transitions. [2024-10-11 19:22:41,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 919 transitions. [2024-10-11 19:22:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 19:22:41,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:41,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:41,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 19:22:41,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:41,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:41,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:41,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1089062238, now seen corresponding path program 1 times [2024-10-11 19:22:41,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:41,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111539194] [2024-10-11 19:22:41,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:41,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:41,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:41,425 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:41,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 19:22:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:41,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:22:41,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:41,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:22:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:41,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:41,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:41,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111539194] [2024-10-11 19:22:41,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111539194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:41,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:41,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:22:41,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638651700] [2024-10-11 19:22:41,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:41,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:41,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:41,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:41,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:41,722 INFO L87 Difference]: Start difference. First operand 835 states and 919 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:43,598 INFO L93 Difference]: Finished difference Result 1241 states and 1321 transitions. [2024-10-11 19:22:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:43,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-11 19:22:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:43,601 INFO L225 Difference]: With dead ends: 1241 [2024-10-11 19:22:43,602 INFO L226 Difference]: Without dead ends: 1241 [2024-10-11 19:22:43,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:43,603 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 561 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:43,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1246 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 19:22:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2024-10-11 19:22:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 831. [2024-10-11 19:22:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 437 states have (on average 2.0755148741418763) internal successors, (907), 825 states have internal predecessors, (907), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 915 transitions. [2024-10-11 19:22:43,631 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 915 transitions. Word has length 31 [2024-10-11 19:22:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:43,631 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 915 transitions. [2024-10-11 19:22:43,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 915 transitions. [2024-10-11 19:22:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 19:22:43,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:43,632 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] [2024-10-11 19:22:43,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 19:22:43,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:43,838 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:43,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:43,839 INFO L85 PathProgramCache]: Analyzing trace with hash 180022231, now seen corresponding path program 1 times [2024-10-11 19:22:43,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:43,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028528725] [2024-10-11 19:22:43,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:43,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:43,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:43,841 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:43,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 19:22:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:44,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:22:44,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:44,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:44,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:44,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028528725] [2024-10-11 19:22:44,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028528725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:44,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:44,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:44,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998969431] [2024-10-11 19:22:44,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:44,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:44,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:44,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:44,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:44,101 INFO L87 Difference]: Start difference. First operand 831 states and 915 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:44,742 INFO L93 Difference]: Finished difference Result 825 states and 905 transitions. [2024-10-11 19:22:44,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:22:44,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-11 19:22:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:44,748 INFO L225 Difference]: With dead ends: 825 [2024-10-11 19:22:44,748 INFO L226 Difference]: Without dead ends: 825 [2024-10-11 19:22:44,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:44,749 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 15 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:44,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2158 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:22:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-11 19:22:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 825. [2024-10-11 19:22:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 431 states have (on average 2.0812064965197217) internal successors, (897), 819 states have internal predecessors, (897), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 905 transitions. [2024-10-11 19:22:44,773 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 905 transitions. Word has length 47 [2024-10-11 19:22:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:44,773 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 905 transitions. [2024-10-11 19:22:44,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 905 transitions. [2024-10-11 19:22:44,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 19:22:44,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:44,779 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] [2024-10-11 19:22:44,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 19:22:44,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:44,980 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:44,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:44,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1008097448, now seen corresponding path program 1 times [2024-10-11 19:22:44,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:44,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214817182] [2024-10-11 19:22:44,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:44,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:44,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:44,982 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:44,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 19:22:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:45,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:22:45,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:45,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:45,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:45,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214817182] [2024-10-11 19:22:45,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214817182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:45,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:45,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:22:45,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013962477] [2024-10-11 19:22:45,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:45,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:22:45,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:45,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:22:45,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:45,400 INFO L87 Difference]: Start difference. First operand 825 states and 905 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:46,185 INFO L93 Difference]: Finished difference Result 1132 states and 1254 transitions. [2024-10-11 19:22:46,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:22:46,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-11 19:22:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:46,189 INFO L225 Difference]: With dead ends: 1132 [2024-10-11 19:22:46,189 INFO L226 Difference]: Without dead ends: 1132 [2024-10-11 19:22:46,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:22:46,190 INFO L432 NwaCegarLoop]: 898 mSDtfsCounter, 278 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:46,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1562 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:22:46,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-10-11 19:22:46,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 998. [2024-10-11 19:22:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 604 states have (on average 2.0298013245033113) internal successors, (1226), 992 states have internal predecessors, (1226), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1234 transitions. [2024-10-11 19:22:46,202 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1234 transitions. Word has length 51 [2024-10-11 19:22:46,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:46,202 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1234 transitions. [2024-10-11 19:22:46,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1234 transitions. [2024-10-11 19:22:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 19:22:46,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:46,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:46,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 19:22:46,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:46,409 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:46,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:46,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1927177814, now seen corresponding path program 1 times [2024-10-11 19:22:46,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:46,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284830391] [2024-10-11 19:22:46,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:46,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:46,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:46,413 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:46,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 19:22:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:46,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:22:46,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:46,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:22:46,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:22:47,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:22:47,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:22:47,246 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:22:47,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:22:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:47,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:47,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:47,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284830391] [2024-10-11 19:22:47,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284830391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:47,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:47,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:22:47,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927921214] [2024-10-11 19:22:47,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:47,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:47,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:47,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:47,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:47,258 INFO L87 Difference]: Start difference. First operand 998 states and 1234 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:49,324 INFO L93 Difference]: Finished difference Result 1368 states and 1729 transitions. [2024-10-11 19:22:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:49,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 19:22:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:49,328 INFO L225 Difference]: With dead ends: 1368 [2024-10-11 19:22:49,328 INFO L226 Difference]: Without dead ends: 1368 [2024-10-11 19:22:49,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:49,329 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 1090 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:49,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 342 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 19:22:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-10-11 19:22:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 933. [2024-10-11 19:22:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 577 states have (on average 1.9480069324090121) internal successors, (1124), 927 states have internal predecessors, (1124), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1132 transitions. [2024-10-11 19:22:49,340 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1132 transitions. Word has length 54 [2024-10-11 19:22:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:49,340 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1132 transitions. [2024-10-11 19:22:49,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1132 transitions. [2024-10-11 19:22:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 19:22:49,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:49,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:49,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-11 19:22:49,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:49,545 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:49,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:49,546 INFO L85 PathProgramCache]: Analyzing trace with hash -697317610, now seen corresponding path program 1 times [2024-10-11 19:22:49,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:49,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903442390] [2024-10-11 19:22:49,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:49,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:49,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:49,550 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:49,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 19:22:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:49,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:22:49,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:49,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:22:49,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:22:49,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 19:22:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:49,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:49,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:49,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903442390] [2024-10-11 19:22:49,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903442390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:49,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:49,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:49,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172841613] [2024-10-11 19:22:49,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:49,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:22:49,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:49,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:22:49,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:49,797 INFO L87 Difference]: Start difference. First operand 933 states and 1132 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:51,462 INFO L93 Difference]: Finished difference Result 932 states and 1131 transitions. [2024-10-11 19:22:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:22:51,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-11 19:22:51,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:51,466 INFO L225 Difference]: With dead ends: 932 [2024-10-11 19:22:51,466 INFO L226 Difference]: Without dead ends: 932 [2024-10-11 19:22:51,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:22:51,468 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 2 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:51,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1815 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 19:22:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-10-11 19:22:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2024-10-11 19:22:51,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 577 states have (on average 1.9462738301559792) internal successors, (1123), 926 states have internal predecessors, (1123), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1131 transitions. [2024-10-11 19:22:51,488 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1131 transitions. Word has length 58 [2024-10-11 19:22:51,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:51,489 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1131 transitions. [2024-10-11 19:22:51,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1131 transitions. [2024-10-11 19:22:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 19:22:51,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:51,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:51,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-11 19:22:51,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:51,690 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:51,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:51,691 INFO L85 PathProgramCache]: Analyzing trace with hash -697317609, now seen corresponding path program 1 times [2024-10-11 19:22:51,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:51,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407606364] [2024-10-11 19:22:51,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:51,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:51,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:51,694 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:51,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 19:22:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:51,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:22:51,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:51,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:22:51,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:22:51,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 19:22:52,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-11 19:22:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:52,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:52,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:52,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407606364] [2024-10-11 19:22:52,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407606364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:52,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:52,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:52,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096249975] [2024-10-11 19:22:52,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:52,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:22:52,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:22:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:22:52,021 INFO L87 Difference]: Start difference. First operand 932 states and 1131 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:54,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:54,043 INFO L93 Difference]: Finished difference Result 931 states and 1130 transitions. [2024-10-11 19:22:54,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:22:54,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-11 19:22:54,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:54,047 INFO L225 Difference]: With dead ends: 931 [2024-10-11 19:22:54,047 INFO L226 Difference]: Without dead ends: 931 [2024-10-11 19:22:54,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:22:54,048 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 1 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:54,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1853 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 19:22:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-10-11 19:22:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 931. [2024-10-11 19:22:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 576 states have (on average 1.9479166666666667) internal successors, (1122), 925 states have internal predecessors, (1122), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:22:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1130 transitions. [2024-10-11 19:22:54,070 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1130 transitions. Word has length 58 [2024-10-11 19:22:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:54,070 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1130 transitions. [2024-10-11 19:22:54,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:22:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1130 transitions. [2024-10-11 19:22:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 19:22:54,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:54,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:54,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-11 19:22:54,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:54,276 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:54,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:54,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1357344986, now seen corresponding path program 1 times [2024-10-11 19:22:54,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:54,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283461813] [2024-10-11 19:22:54,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:54,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:54,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:54,279 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:54,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 19:22:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:54,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:22:54,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:54,548 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:22:54,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283461813] [2024-10-11 19:22:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283461813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:22:54,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:22:54,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:22:54,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291055733] [2024-10-11 19:22:54,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:22:54,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:22:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:54,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:22:54,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:54,550 INFO L87 Difference]: Start difference. First operand 931 states and 1130 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 19:22:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:55,280 INFO L93 Difference]: Finished difference Result 933 states and 1133 transitions. [2024-10-11 19:22:55,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:22:55,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2024-10-11 19:22:55,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:55,288 INFO L225 Difference]: With dead ends: 933 [2024-10-11 19:22:55,288 INFO L226 Difference]: Without dead ends: 933 [2024-10-11 19:22:55,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:22:55,288 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 0 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:55,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2094 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:22:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-10-11 19:22:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2024-10-11 19:22:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 577 states have (on average 1.9480069324090121) internal successors, (1124), 927 states have internal predecessors, (1124), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:22:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1133 transitions. [2024-10-11 19:22:55,306 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1133 transitions. Word has length 64 [2024-10-11 19:22:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:55,306 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1133 transitions. [2024-10-11 19:22:55,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 19:22:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1133 transitions. [2024-10-11 19:22:55,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 19:22:55,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:55,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:55,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 19:22:55,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:55,508 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:55,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:55,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1218431584, now seen corresponding path program 1 times [2024-10-11 19:22:55,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:55,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114719991] [2024-10-11 19:22:55,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:22:55,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:55,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:55,511 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:55,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 19:22:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:22:55,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:22:55,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:55,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:22:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:55,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:55,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114719991] [2024-10-11 19:22:55,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114719991] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:22:55,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:22:55,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 19:22:55,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444234219] [2024-10-11 19:22:55,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:22:55,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:22:55,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:55,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:22:55,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:22:55,791 INFO L87 Difference]: Start difference. First operand 933 states and 1133 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:22:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:56,912 INFO L93 Difference]: Finished difference Result 942 states and 1147 transitions. [2024-10-11 19:22:56,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:22:56,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2024-10-11 19:22:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:56,916 INFO L225 Difference]: With dead ends: 942 [2024-10-11 19:22:56,916 INFO L226 Difference]: Without dead ends: 942 [2024-10-11 19:22:56,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:22:56,917 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 4 mSDsluCounter, 2785 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:56,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3483 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:22:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2024-10-11 19:22:56,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 941. [2024-10-11 19:22:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 584 states have (on average 1.946917808219178) internal successors, (1137), 934 states have internal predecessors, (1137), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:22:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1146 transitions. [2024-10-11 19:22:56,926 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1146 transitions. Word has length 65 [2024-10-11 19:22:56,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:56,926 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1146 transitions. [2024-10-11 19:22:56,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:22:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1146 transitions. [2024-10-11 19:22:56,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 19:22:56,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:56,927 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:56,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-11 19:22:57,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:57,128 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:57,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:57,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1957334438, now seen corresponding path program 2 times [2024-10-11 19:22:57,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:57,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431153094] [2024-10-11 19:22:57,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:22:57,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:57,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:57,130 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:57,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-11 19:22:57,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:22:57,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:22:57,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:22:57,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:22:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:57,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:22:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:22:57,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:22:57,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431153094] [2024-10-11 19:22:57,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431153094] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:22:57,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:22:57,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 19:22:57,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141969794] [2024-10-11 19:22:57,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:22:57,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:22:57,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:22:57,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:22:57,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:22:57,684 INFO L87 Difference]: Start difference. First operand 941 states and 1146 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:22:59,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:22:59,167 INFO L93 Difference]: Finished difference Result 953 states and 1165 transitions. [2024-10-11 19:22:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:22:59,169 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-10-11 19:22:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:22:59,171 INFO L225 Difference]: With dead ends: 953 [2024-10-11 19:22:59,171 INFO L226 Difference]: Without dead ends: 951 [2024-10-11 19:22:59,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 19:22:59,172 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 7 mSDsluCounter, 3485 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4183 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:22:59,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4183 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 19:22:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-10-11 19:22:59,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 950. [2024-10-11 19:22:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 593 states have (on average 1.9376053962900506) internal successors, (1149), 943 states have internal predecessors, (1149), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:22:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1158 transitions. [2024-10-11 19:22:59,182 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1158 transitions. Word has length 68 [2024-10-11 19:22:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:22:59,182 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1158 transitions. [2024-10-11 19:22:59,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:22:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1158 transitions. [2024-10-11 19:22:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 19:22:59,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:22:59,183 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:22:59,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-11 19:22:59,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:59,384 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:22:59,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:22:59,384 INFO L85 PathProgramCache]: Analyzing trace with hash 3837082, now seen corresponding path program 3 times [2024-10-11 19:22:59,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:22:59,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399820014] [2024-10-11 19:22:59,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:22:59,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:22:59,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:22:59,386 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:22:59,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-11 19:22:59,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:22:59,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:22:59,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:22:59,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:23:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:23:00,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:23:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:23:00,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:23:00,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399820014] [2024-10-11 19:23:00,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399820014] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:23:00,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:23:00,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 19:23:00,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792621864] [2024-10-11 19:23:00,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:23:00,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:23:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:23:00,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:23:00,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:23:00,546 INFO L87 Difference]: Start difference. First operand 950 states and 1158 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:23:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:23:04,386 INFO L93 Difference]: Finished difference Result 971 states and 1194 transitions. [2024-10-11 19:23:04,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 19:23:04,387 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2024-10-11 19:23:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:23:04,389 INFO L225 Difference]: With dead ends: 971 [2024-10-11 19:23:04,390 INFO L226 Difference]: Without dead ends: 968 [2024-10-11 19:23:04,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 19:23:04,391 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 13 mSDsluCounter, 9752 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 10450 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:23:04,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 10450 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 19:23:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-10-11 19:23:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 968. [2024-10-11 19:23:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 611 states have (on average 1.9181669394435352) internal successors, (1172), 961 states have internal predecessors, (1172), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:23:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1181 transitions. [2024-10-11 19:23:04,413 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1181 transitions. Word has length 74 [2024-10-11 19:23:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:23:04,414 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1181 transitions. [2024-10-11 19:23:04,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:23:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1181 transitions. [2024-10-11 19:23:04,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 19:23:04,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:23:04,414 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:23:04,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-11 19:23:04,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:23:04,615 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:23:04,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:23:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1170387226, now seen corresponding path program 4 times [2024-10-11 19:23:04,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:23:04,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142445828] [2024-10-11 19:23:04,616 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:23:04,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:23:04,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:23:04,618 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:23:04,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-11 19:23:05,182 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:23:05,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:23:05,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 19:23:05,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:23:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:23:05,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:23:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:23:07,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:23:07,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142445828] [2024-10-11 19:23:07,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142445828] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:23:07,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:23:07,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 19:23:07,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393945274] [2024-10-11 19:23:07,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:23:07,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 19:23:07,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:23:07,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 19:23:07,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 19:23:07,256 INFO L87 Difference]: Start difference. First operand 968 states and 1181 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:23:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:23:16,231 INFO L93 Difference]: Finished difference Result 1005 states and 1249 transitions. [2024-10-11 19:23:16,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 19:23:16,232 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-10-11 19:23:16,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:23:16,235 INFO L225 Difference]: With dead ends: 1005 [2024-10-11 19:23:16,236 INFO L226 Difference]: Without dead ends: 1002 [2024-10-11 19:23:16,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 19:23:16,238 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 25 mSDsluCounter, 16721 mSDsCounter, 0 mSdLazyCounter, 4131 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 17419 SdHoareTripleChecker+Invalid, 4161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:23:16,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 17419 Invalid, 4161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4131 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-11 19:23:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2024-10-11 19:23:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2024-10-11 19:23:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 645 states have (on average 1.8837209302325582) internal successors, (1215), 995 states have internal predecessors, (1215), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:23:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1224 transitions. [2024-10-11 19:23:16,248 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1224 transitions. Word has length 86 [2024-10-11 19:23:16,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:23:16,249 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1224 transitions. [2024-10-11 19:23:16,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:23:16,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1224 transitions. [2024-10-11 19:23:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 19:23:16,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:23:16,250 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, 1, 1, 1, 1, 1] [2024-10-11 19:23:16,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-11 19:23:16,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:23:16,453 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-10-11 19:23:16,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:23:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1192509786, now seen corresponding path program 5 times [2024-10-11 19:23:16,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:23:16,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098537054] [2024-10-11 19:23:16,455 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:23:16,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:23:16,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:23:16,456 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:23:16,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-11 19:23:17,648 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-11 19:23:17,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:23:17,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 19:23:17,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:23:17,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:23:17,770 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:23:17,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-11 19:23:17,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:23:17,887 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 24 treesize of output 12 [2024-10-11 19:23:18,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 19:23:18,596 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 44 treesize of output 43 [2024-10-11 19:23:18,634 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 33 treesize of output 15 [2024-10-11 19:23:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-11 19:23:18,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:23:18,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2000) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-10-11 19:23:18,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:23:18,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098537054] [2024-10-11 19:23:18,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098537054] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:23:18,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [789442976] [2024-10-11 19:23:18,930 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:23:18,930 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 19:23:18,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 19:23:18,932 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 19:23:18,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process