./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:13:09,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:13:09,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:13:09,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:13:09,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:13:09,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:13:09,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:13:09,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:13:09,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:13:09,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:13:09,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:13:09,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:13:09,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:13:09,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:13:09,141 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:13:09,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:13:09,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:13:09,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:13:09,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:13:09,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:13:09,144 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:13:09,145 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:13:09,145 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:13:09,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:13:09,145 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:13:09,145 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:13:09,146 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:13:09,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:13:09,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:13:09,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:13:09,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:13:09,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:13:09,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:13:09,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:13:09,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:13:09,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:13:09,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:13:09,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:13:09,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:13:09,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:13:09,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:13:09,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:13:09,150 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-10-14 19:13:09,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:13:09,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:13:09,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:13:09,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:13:09,486 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:13:09,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2024-10-14 19:13:10,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:13:11,169 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:13:11,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2024-10-14 19:13:11,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d601843a/a6449d33cc7640faa8be5dad832581cd/FLAG6692b7c80 [2024-10-14 19:13:11,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d601843a/a6449d33cc7640faa8be5dad832581cd [2024-10-14 19:13:11,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:13:11,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:13:11,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:13:11,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:13:11,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:13:11,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:13:11" (1/1) ... [2024-10-14 19:13:11,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e29ea50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:11, skipping insertion in model container [2024-10-14 19:13:11,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:13:11" (1/1) ... [2024-10-14 19:13:11,524 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:13:12,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:13:12,043 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-14 19:13:12,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6a10bbe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:12, skipping insertion in model container [2024-10-14 19:13:12,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:13:12,044 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 19:13:12,047 INFO L158 Benchmark]: Toolchain (without parser) took 590.06ms. Allocated memory is still 157.3MB. Free memory was 122.9MB in the beginning and 102.9MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 19:13:12,047 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:13:12,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.66ms. Allocated memory is still 157.3MB. Free memory was 122.9MB in the beginning and 102.9MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 19:13:12,049 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 585.66ms. Allocated memory is still 157.3MB. Free memory was 122.9MB in the beginning and 102.9MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 817]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:13:14,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:13:14,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:13:14,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:13:14,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:13:14,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:13:14,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:13:14,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:13:14,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:13:14,192 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:13:14,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:13:14,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:13:14,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:13:14,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:13:14,195 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:13:14,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:13:14,196 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:13:14,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:13:14,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:13:14,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:13:14,197 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:13:14,200 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:13:14,200 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:13:14,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:13:14,201 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:13:14,203 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:13:14,203 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:13:14,203 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:13:14,204 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:13:14,204 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:13:14,204 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:13:14,204 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:13:14,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:13:14,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:13:14,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:13:14,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:13:14,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:13:14,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:13:14,207 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:13:14,207 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:13:14,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:13:14,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:13:14,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:13:14,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:13:14,209 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:13:14,209 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-10-14 19:13:14,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:13:14,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:13:14,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:13:14,582 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:13:14,582 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:13:14,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2024-10-14 19:13:16,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:13:16,446 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:13:16,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2024-10-14 19:13:16,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529c9d000/2de00ca65292446e9315594a563d5fff/FLAGe1919a564 [2024-10-14 19:13:16,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529c9d000/2de00ca65292446e9315594a563d5fff [2024-10-14 19:13:16,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:13:16,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:13:16,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:13:16,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:13:16,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:13:16,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:13:16" (1/1) ... [2024-10-14 19:13:16,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580c46ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:16, skipping insertion in model container [2024-10-14 19:13:16,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:13:16" (1/1) ... [2024-10-14 19:13:16,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:13:17,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:13:17,338 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 19:13:17,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:13:17,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:13:17,440 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:13:17,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:13:17,600 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:13:17,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:17 WrapperNode [2024-10-14 19:13:17,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:13:17,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:13:17,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:13:17,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:13:17,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:17" (1/1) ... [2024-10-14 19:13:17,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:17" (1/1) ... [2024-10-14 19:13:17,703 INFO L138 Inliner]: procedures = 210, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 892 [2024-10-14 19:13:17,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:13:17,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:13:17,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:13:17,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:13:17,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:17" (1/1) ... [2024-10-14 19:13:17,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:17" (1/1) ... [2024-10-14 19:13:17,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:17" (1/1) ... [2024-10-14 19:13:17,801 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-10-14 19:13:17,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:17" (1/1) ... [2024-10-14 19:13:17,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:17" (1/1) ... [2024-10-14 19:13:17,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:17" (1/1) ... [2024-10-14 19:13:17,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:17" (1/1) ... [2024-10-14 19:13:17,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:17" (1/1) ... [2024-10-14 19:13:17,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:17" (1/1) ... [2024-10-14 19:13:17,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:13:17,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:13:17,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:13:17,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:13:17,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:17" (1/1) ... [2024-10-14 19:13:17,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:13:17,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:13:17,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:13:17,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:13:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 19:13:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 19:13:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 19:13:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 19:13:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 19:13:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 19:13:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 19:13:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 19:13:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 19:13:17,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 19:13:17,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 19:13:17,983 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 19:13:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 19:13:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:13:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:13:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 19:13:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 19:13:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 19:13:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 19:13:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 19:13:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:13:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 19:13:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 19:13:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:13:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:13:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:13:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:13:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 19:13:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:13:17,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:13:18,207 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:13:18,209 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:13:18,213 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:13:18,267 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:13:18,293 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:13:21,286 INFO L? ?]: Removed 864 outVars from TransFormulas that were not future-live. [2024-10-14 19:13:21,286 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:13:21,469 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:13:21,473 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-14 19:13:21,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:13:21 BoogieIcfgContainer [2024-10-14 19:13:21,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:13:21,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:13:21,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:13:21,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:13:21,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:13:16" (1/3) ... [2024-10-14 19:13:21,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26776f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:13:21, skipping insertion in model container [2024-10-14 19:13:21,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:13:17" (2/3) ... [2024-10-14 19:13:21,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26776f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:13:21, skipping insertion in model container [2024-10-14 19:13:21,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:13:21" (3/3) ... [2024-10-14 19:13:21,482 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-1.i [2024-10-14 19:13:21,498 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:13:21,498 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 420 error locations. [2024-10-14 19:13:21,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:13:21,572 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;@1fb2a5d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:13:21,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-10-14 19:13:21,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 774 states, 352 states have (on average 2.4857954545454546) internal successors, (875), 769 states have internal predecessors, (875), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 19:13:21,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:21,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 19:13:21,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:21,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:21,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1423701, now seen corresponding path program 1 times [2024-10-14 19:13:21,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:21,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787916247] [2024-10-14 19:13:21,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:21,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:21,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:21,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:21,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 19:13:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:21,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:13:21,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:21,838 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_56| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_56|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_56| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-14 19:13:21,839 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-14 19:13:21,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:21,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:21,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787916247] [2024-10-14 19:13:21,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787916247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:21,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:21,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:13:21,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350976037] [2024-10-14 19:13:21,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:21,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:13:21,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:21,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:13:21,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 19:13:21,879 INFO L87 Difference]: Start difference. First operand has 774 states, 352 states have (on average 2.4857954545454546) internal successors, (875), 769 states have internal predecessors, (875), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:23,427 INFO L93 Difference]: Finished difference Result 957 states and 1037 transitions. [2024-10-14 19:13:23,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:13:23,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-10-14 19:13:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:23,453 INFO L225 Difference]: With dead ends: 957 [2024-10-14 19:13:23,454 INFO L226 Difference]: Without dead ends: 955 [2024-10-14 19:13:23,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 19:13:23,458 INFO L432 NwaCegarLoop]: 638 mSDtfsCounter, 213 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1038 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:23,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1016 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 603 Invalid, 0 Unknown, 1038 Unchecked, 1.5s Time] [2024-10-14 19:13:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-10-14 19:13:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 763. [2024-10-14 19:13:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 347 states have (on average 2.314121037463977) internal successors, (803), 758 states have internal predecessors, (803), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 809 transitions. [2024-10-14 19:13:23,533 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 809 transitions. Word has length 3 [2024-10-14 19:13:23,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:23,534 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 809 transitions. [2024-10-14 19:13:23,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 809 transitions. [2024-10-14 19:13:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 19:13:23,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:23,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 19:13:23,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 19:13:23,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:23,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:23,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:23,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1422409, now seen corresponding path program 1 times [2024-10-14 19:13:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:23,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457605631] [2024-10-14 19:13:23,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:23,739 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-14 19:13:23,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:23,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:23,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 19:13:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:23,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:13:23,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:23,872 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-14 19:13:23,882 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-14 19:13:23,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:23,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:23,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457605631] [2024-10-14 19:13:23,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457605631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:23,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:23,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:13:23,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107661850] [2024-10-14 19:13:23,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:23,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:13:23,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:23,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:13:23,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:13:23,886 INFO L87 Difference]: Start difference. First operand 763 states and 809 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:24,789 INFO L93 Difference]: Finished difference Result 760 states and 807 transitions. [2024-10-14 19:13:24,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:13:24,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-10-14 19:13:24,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:24,794 INFO L225 Difference]: With dead ends: 760 [2024-10-14 19:13:24,795 INFO L226 Difference]: Without dead ends: 760 [2024-10-14 19:13:24,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-14 19:13:24,797 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 701 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:24,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 448 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 19:13:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-10-14 19:13:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2024-10-14 19:13:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 355 states have (on average 2.256338028169014) internal successors, (801), 755 states have internal predecessors, (801), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 807 transitions. [2024-10-14 19:13:24,814 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 807 transitions. Word has length 3 [2024-10-14 19:13:24,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:24,814 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 807 transitions. [2024-10-14 19:13:24,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 807 transitions. [2024-10-14 19:13:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 19:13:24,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:24,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 19:13:24,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 19:13:25,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:25,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:25,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:25,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1422410, now seen corresponding path program 1 times [2024-10-14 19:13:25,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:25,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851984134] [2024-10-14 19:13:25,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:25,019 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-14 19:13:25,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:25,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:25,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 19:13:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:25,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:13:25,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:25,112 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-14 19:13:25,130 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-14 19:13:25,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:25,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851984134] [2024-10-14 19:13:25,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851984134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:25,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:25,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:13:25,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545275819] [2024-10-14 19:13:25,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:25,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:13:25,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:25,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:13:25,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:13:25,132 INFO L87 Difference]: Start difference. First operand 760 states and 807 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:26,733 INFO L93 Difference]: Finished difference Result 951 states and 1019 transitions. [2024-10-14 19:13:26,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:13:26,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-10-14 19:13:26,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:26,737 INFO L225 Difference]: With dead ends: 951 [2024-10-14 19:13:26,737 INFO L226 Difference]: Without dead ends: 951 [2024-10-14 19:13:26,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-14 19:13:26,741 INFO L432 NwaCegarLoop]: 640 mSDtfsCounter, 212 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:26,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1021 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 19:13:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-10-14 19:13:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 865. [2024-10-14 19:13:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 461 states have (on average 2.190889370932755) internal successors, (1010), 860 states have internal predecessors, (1010), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1016 transitions. [2024-10-14 19:13:26,760 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1016 transitions. Word has length 3 [2024-10-14 19:13:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:26,761 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1016 transitions. [2024-10-14 19:13:26,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1016 transitions. [2024-10-14 19:13:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:13:26,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:26,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:13:26,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 19:13:26,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:26,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:26,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:26,965 INFO L85 PathProgramCache]: Analyzing trace with hash -635064749, now seen corresponding path program 1 times [2024-10-14 19:13:26,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:26,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831469171] [2024-10-14 19:13:26,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:26,966 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-14 19:13:26,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:26,970 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:26,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 19:13:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:27,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:13:27,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:27,103 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-14 19:13:27,115 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-14 19:13:27,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:13:27,209 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-14 19:13:27,225 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:13:27,226 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-14 19:13:27,257 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-14 19:13:27,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:27,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:27,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831469171] [2024-10-14 19:13:27,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831469171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:27,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:27,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:13:27,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014386889] [2024-10-14 19:13:27,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:27,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:13:27,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:27,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:13:27,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:13:27,260 INFO L87 Difference]: Start difference. First operand 865 states and 1016 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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-14 19:13:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:28,992 INFO L93 Difference]: Finished difference Result 854 states and 1004 transitions. [2024-10-14 19:13:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:13:28,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-14 19:13:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:28,996 INFO L225 Difference]: With dead ends: 854 [2024-10-14 19:13:28,996 INFO L226 Difference]: Without dead ends: 854 [2024-10-14 19:13:28,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-14 19:13:29,001 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 773 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:29,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 222 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 19:13:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-10-14 19:13:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 748. [2024-10-14 19:13:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 355 states have (on average 2.219718309859155) internal successors, (788), 743 states have internal predecessors, (788), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 794 transitions. [2024-10-14 19:13:29,022 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 794 transitions. Word has length 7 [2024-10-14 19:13:29,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:29,022 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 794 transitions. [2024-10-14 19:13:29,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-14 19:13:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 794 transitions. [2024-10-14 19:13:29,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 19:13:29,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:29,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:13:29,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 19:13:29,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:29,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:29,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:29,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1787829258, now seen corresponding path program 1 times [2024-10-14 19:13:29,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:29,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325298544] [2024-10-14 19:13:29,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:29,232 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-14 19:13:29,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:29,233 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:29,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 19:13:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:29,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:13:29,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:29,341 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-14 19:13:29,351 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-14 19:13:29,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:29,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:29,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325298544] [2024-10-14 19:13:29,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325298544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:29,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:29,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:13:29,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127140259] [2024-10-14 19:13:29,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:29,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:13:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:29,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:13:29,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:13:29,353 INFO L87 Difference]: Start difference. First operand 748 states and 794 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:30,340 INFO L93 Difference]: Finished difference Result 893 states and 960 transitions. [2024-10-14 19:13:30,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:13:30,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-10-14 19:13:30,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:30,343 INFO L225 Difference]: With dead ends: 893 [2024-10-14 19:13:30,343 INFO L226 Difference]: Without dead ends: 893 [2024-10-14 19:13:30,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-14 19:13:30,344 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 668 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:30,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 653 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 19:13:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-10-14 19:13:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 701. [2024-10-14 19:13:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 355 states have (on average 2.0873239436619717) internal successors, (741), 696 states have internal predecessors, (741), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 747 transitions. [2024-10-14 19:13:30,358 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 747 transitions. Word has length 8 [2024-10-14 19:13:30,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:30,358 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 747 transitions. [2024-10-14 19:13:30,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 747 transitions. [2024-10-14 19:13:30,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 19:13:30,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:30,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:13:30,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 19:13:30,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:30,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:30,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:30,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1787829259, now seen corresponding path program 1 times [2024-10-14 19:13:30,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:30,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402490456] [2024-10-14 19:13:30,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:30,561 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-14 19:13:30,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:30,563 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:30,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 19:13:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:30,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:13:30,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:30,694 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-14 19:13:30,720 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-14 19:13:30,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:30,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:30,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402490456] [2024-10-14 19:13:30,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402490456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:30,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:30,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:13:30,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458858318] [2024-10-14 19:13:30,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:30,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:13:30,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:30,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:13:30,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:13:30,722 INFO L87 Difference]: Start difference. First operand 701 states and 747 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:32,012 INFO L93 Difference]: Finished difference Result 958 states and 1027 transitions. [2024-10-14 19:13:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:13:32,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-10-14 19:13:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:32,016 INFO L225 Difference]: With dead ends: 958 [2024-10-14 19:13:32,016 INFO L226 Difference]: Without dead ends: 958 [2024-10-14 19:13:32,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-14 19:13:32,017 INFO L432 NwaCegarLoop]: 679 mSDtfsCounter, 449 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:32,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 932 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 19:13:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-14 19:13:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 718. [2024-10-14 19:13:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 382 states have (on average 2.081151832460733) internal successors, (795), 713 states have internal predecessors, (795), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 801 transitions. [2024-10-14 19:13:32,031 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 801 transitions. Word has length 8 [2024-10-14 19:13:32,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:32,032 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 801 transitions. [2024-10-14 19:13:32,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:32,032 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 801 transitions. [2024-10-14 19:13:32,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 19:13:32,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:32,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:13:32,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-14 19:13:32,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:32,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:32,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:32,234 INFO L85 PathProgramCache]: Analyzing trace with hash 909211593, now seen corresponding path program 1 times [2024-10-14 19:13:32,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:32,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735916582] [2024-10-14 19:13:32,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:32,235 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-14 19:13:32,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:32,236 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:32,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 19:13:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:32,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:13:32,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:32,447 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_57| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_57|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_57| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-14 19:13:32,448 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-14 19:13:32,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:32,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:32,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735916582] [2024-10-14 19:13:32,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735916582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:32,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:32,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:13:32,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881196684] [2024-10-14 19:13:32,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:32,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:13:32,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:32,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:13:32,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 19:13:32,450 INFO L87 Difference]: Start difference. First operand 718 states and 801 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:33,425 INFO L93 Difference]: Finished difference Result 911 states and 1014 transitions. [2024-10-14 19:13:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:13:33,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 19:13:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:33,428 INFO L225 Difference]: With dead ends: 911 [2024-10-14 19:13:33,429 INFO L226 Difference]: Without dead ends: 909 [2024-10-14 19:13:33,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 19:13:33,430 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 206 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 941 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:33,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 940 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 515 Invalid, 0 Unknown, 941 Unchecked, 1.0s Time] [2024-10-14 19:13:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-10-14 19:13:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 824. [2024-10-14 19:13:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 488 states have (on average 2.057377049180328) internal successors, (1004), 819 states have internal predecessors, (1004), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:33,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1010 transitions. [2024-10-14 19:13:33,448 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1010 transitions. Word has length 10 [2024-10-14 19:13:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:33,448 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1010 transitions. [2024-10-14 19:13:33,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1010 transitions. [2024-10-14 19:13:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 19:13:33,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:33,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:13:33,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 19:13:33,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:33,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:33,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:33,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1909059356, now seen corresponding path program 1 times [2024-10-14 19:13:33,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:33,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240402367] [2024-10-14 19:13:33,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:33,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:33,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:33,656 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:33,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 19:13:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:33,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:13:33,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:33,768 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-14 19:13:33,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:33,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:33,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240402367] [2024-10-14 19:13:33,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240402367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:33,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:33,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:13:33,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422766702] [2024-10-14 19:13:33,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:33,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:13:33,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:33,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:13:33,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:13:33,770 INFO L87 Difference]: Start difference. First operand 824 states and 1010 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:34,154 INFO L93 Difference]: Finished difference Result 770 states and 930 transitions. [2024-10-14 19:13:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:13:34,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 19:13:34,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:34,157 INFO L225 Difference]: With dead ends: 770 [2024-10-14 19:13:34,157 INFO L226 Difference]: Without dead ends: 770 [2024-10-14 19:13:34,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-14 19:13:34,158 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 61 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:34,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1150 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 19:13:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-10-14 19:13:34,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2024-10-14 19:13:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 458 states have (on average 2.017467248908297) internal successors, (924), 765 states have internal predecessors, (924), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 930 transitions. [2024-10-14 19:13:34,172 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 930 transitions. Word has length 13 [2024-10-14 19:13:34,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:34,172 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 930 transitions. [2024-10-14 19:13:34,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 930 transitions. [2024-10-14 19:13:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 19:13:34,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:34,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:13:34,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 19:13:34,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:34,374 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:34,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash 655031158, now seen corresponding path program 1 times [2024-10-14 19:13:34,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:34,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600036240] [2024-10-14 19:13:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:34,375 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-14 19:13:34,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:34,377 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:34,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 19:13:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:34,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:13:34,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:34,520 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-14 19:13:34,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:34,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:34,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600036240] [2024-10-14 19:13:34,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600036240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:34,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:34,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:13:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192935358] [2024-10-14 19:13:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:34,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:13:34,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:34,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:13:34,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:13:34,522 INFO L87 Difference]: Start difference. First operand 770 states and 930 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:35,044 INFO L93 Difference]: Finished difference Result 754 states and 886 transitions. [2024-10-14 19:13:35,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:13:35,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 19:13:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:35,047 INFO L225 Difference]: With dead ends: 754 [2024-10-14 19:13:35,047 INFO L226 Difference]: Without dead ends: 754 [2024-10-14 19:13:35,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-14 19:13:35,048 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 45 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:35,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1677 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:13:35,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-14 19:13:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-14 19:13:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 456 states have (on average 1.9298245614035088) internal successors, (880), 749 states have internal predecessors, (880), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:35,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 886 transitions. [2024-10-14 19:13:35,060 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 886 transitions. Word has length 15 [2024-10-14 19:13:35,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:35,061 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 886 transitions. [2024-10-14 19:13:35,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:35,061 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 886 transitions. [2024-10-14 19:13:35,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 19:13:35,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:35,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:13:35,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 19:13:35,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:35,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:35,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:35,266 INFO L85 PathProgramCache]: Analyzing trace with hash 880142785, now seen corresponding path program 1 times [2024-10-14 19:13:35,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:35,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090766467] [2024-10-14 19:13:35,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:35,266 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-14 19:13:35,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:35,269 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:35,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 19:13:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:35,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:13:35,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:35,409 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-14 19:13:35,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:35,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:35,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090766467] [2024-10-14 19:13:35,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090766467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:35,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:35,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:13:35,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221784998] [2024-10-14 19:13:35,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:35,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:13:35,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:35,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:13:35,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:13:35,411 INFO L87 Difference]: Start difference. First operand 754 states and 886 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:35,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:35,766 INFO L93 Difference]: Finished difference Result 715 states and 846 transitions. [2024-10-14 19:13:35,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:13:35,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 19:13:35,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:35,769 INFO L225 Difference]: With dead ends: 715 [2024-10-14 19:13:35,769 INFO L226 Difference]: Without dead ends: 715 [2024-10-14 19:13:35,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-14 19:13:35,770 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 61 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:35,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1034 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 19:13:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-14 19:13:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-14 19:13:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 441 states have (on average 1.9047619047619047) internal successors, (840), 710 states have internal predecessors, (840), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 846 transitions. [2024-10-14 19:13:35,781 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 846 transitions. Word has length 16 [2024-10-14 19:13:35,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:35,781 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 846 transitions. [2024-10-14 19:13:35,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:35,781 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 846 transitions. [2024-10-14 19:13:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 19:13:35,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:35,781 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:13:35,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 19:13:35,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:35,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:35,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:35,986 INFO L85 PathProgramCache]: Analyzing trace with hash -291343813, now seen corresponding path program 1 times [2024-10-14 19:13:35,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:35,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586356773] [2024-10-14 19:13:35,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:35,987 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-14 19:13:35,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:35,988 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:35,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 19:13:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:36,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:13:36,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:36,135 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-14 19:13:36,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:36,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:36,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586356773] [2024-10-14 19:13:36,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586356773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:36,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:36,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:13:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662387491] [2024-10-14 19:13:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:36,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:13:36,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:36,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:13:36,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:13:36,137 INFO L87 Difference]: Start difference. First operand 715 states and 846 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:36,687 INFO L93 Difference]: Finished difference Result 700 states and 824 transitions. [2024-10-14 19:13:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:13:36,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-10-14 19:13:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:36,690 INFO L225 Difference]: With dead ends: 700 [2024-10-14 19:13:36,690 INFO L226 Difference]: Without dead ends: 700 [2024-10-14 19:13:36,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-14 19:13:36,691 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 45 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:36,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1503 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:13:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-14 19:13:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2024-10-14 19:13:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 440 states have (on average 1.8590909090909091) internal successors, (818), 695 states have internal predecessors, (818), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:36,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 824 transitions. [2024-10-14 19:13:36,701 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 824 transitions. Word has length 18 [2024-10-14 19:13:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:36,702 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 824 transitions. [2024-10-14 19:13:36,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 824 transitions. [2024-10-14 19:13:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 19:13:36,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:36,703 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] [2024-10-14 19:13:36,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 19:13:36,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:36,903 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:36,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:36,904 INFO L85 PathProgramCache]: Analyzing trace with hash 46215140, now seen corresponding path program 1 times [2024-10-14 19:13:36,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:36,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288000928] [2024-10-14 19:13:36,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:36,904 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-14 19:13:36,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:36,905 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:36,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 19:13:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:37,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:13:37,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:37,032 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-14 19:13:37,100 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-14 19:13:37,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:37,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:37,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288000928] [2024-10-14 19:13:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288000928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:37,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:37,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:13:37,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039566097] [2024-10-14 19:13:37,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:37,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:13:37,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:37,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:13:37,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:13:37,102 INFO L87 Difference]: Start difference. First operand 700 states and 824 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:38,049 INFO L93 Difference]: Finished difference Result 704 states and 824 transitions. [2024-10-14 19:13:38,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:13:38,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-14 19:13:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:38,051 INFO L225 Difference]: With dead ends: 704 [2024-10-14 19:13:38,052 INFO L226 Difference]: Without dead ends: 704 [2024-10-14 19:13:38,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-14 19:13:38,052 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 524 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:38,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 637 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 19:13:38,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-10-14 19:13:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 696. [2024-10-14 19:13:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 440 states have (on average 1.8409090909090908) internal successors, (810), 691 states have internal predecessors, (810), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 816 transitions. [2024-10-14 19:13:38,063 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 816 transitions. Word has length 29 [2024-10-14 19:13:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:38,063 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 816 transitions. [2024-10-14 19:13:38,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 816 transitions. [2024-10-14 19:13:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 19:13:38,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:38,064 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] [2024-10-14 19:13:38,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 19:13:38,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:38,265 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:38,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash 46215141, now seen corresponding path program 1 times [2024-10-14 19:13:38,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:38,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257449175] [2024-10-14 19:13:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:38,266 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-14 19:13:38,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:38,267 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:38,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 19:13:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:38,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:13:38,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:38,384 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-14 19:13:38,567 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-14 19:13:38,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:38,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:38,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257449175] [2024-10-14 19:13:38,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257449175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:38,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:38,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:13:38,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409543423] [2024-10-14 19:13:38,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:38,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:13:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:38,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:13:38,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:13:38,569 INFO L87 Difference]: Start difference. First operand 696 states and 816 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:39,771 INFO L93 Difference]: Finished difference Result 739 states and 818 transitions. [2024-10-14 19:13:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:13:39,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-14 19:13:39,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:39,774 INFO L225 Difference]: With dead ends: 739 [2024-10-14 19:13:39,774 INFO L226 Difference]: Without dead ends: 739 [2024-10-14 19:13:39,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-14 19:13:39,776 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 147 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:39,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1027 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 19:13:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-10-14 19:13:39,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 696. [2024-10-14 19:13:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 440 states have (on average 1.8318181818181818) internal successors, (806), 691 states have internal predecessors, (806), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 812 transitions. [2024-10-14 19:13:39,786 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 812 transitions. Word has length 29 [2024-10-14 19:13:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:39,787 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 812 transitions. [2024-10-14 19:13:39,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 812 transitions. [2024-10-14 19:13:39,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 19:13:39,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:39,788 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] [2024-10-14 19:13:39,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-14 19:13:39,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:39,989 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:39,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:39,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1541264503, now seen corresponding path program 1 times [2024-10-14 19:13:39,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:39,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695646824] [2024-10-14 19:13:39,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:39,990 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-14 19:13:39,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:39,993 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:39,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 19:13:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:40,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:13:40,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:40,132 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-14 19:13:40,215 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-14 19:13:40,216 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:40,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:40,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695646824] [2024-10-14 19:13:40,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695646824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:40,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:40,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:13:40,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255214278] [2024-10-14 19:13:40,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:40,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:13:40,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:40,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:13:40,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:13:40,217 INFO L87 Difference]: Start difference. First operand 696 states and 812 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:41,240 INFO L93 Difference]: Finished difference Result 735 states and 814 transitions. [2024-10-14 19:13:41,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:13:41,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-14 19:13:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:41,243 INFO L225 Difference]: With dead ends: 735 [2024-10-14 19:13:41,243 INFO L226 Difference]: Without dead ends: 735 [2024-10-14 19:13:41,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-14 19:13:41,243 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 538 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:41,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 807 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 19:13:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-10-14 19:13:41,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 692. [2024-10-14 19:13:41,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 440 states have (on average 1.8227272727272728) internal successors, (802), 687 states have internal predecessors, (802), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 808 transitions. [2024-10-14 19:13:41,252 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 808 transitions. Word has length 32 [2024-10-14 19:13:41,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:41,253 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 808 transitions. [2024-10-14 19:13:41,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:41,253 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 808 transitions. [2024-10-14 19:13:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 19:13:41,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:41,254 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] [2024-10-14 19:13:41,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-14 19:13:41,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:41,455 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:41,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:41,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1541264502, now seen corresponding path program 1 times [2024-10-14 19:13:41,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:41,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859766657] [2024-10-14 19:13:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:41,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-14 19:13:41,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:41,458 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:41,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 19:13:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:41,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:13:41,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:41,618 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-14 19:13:41,748 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-14 19:13:41,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:41,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:41,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859766657] [2024-10-14 19:13:41,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859766657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:41,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:41,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:13:41,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763805408] [2024-10-14 19:13:41,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:41,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:13:41,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:41,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:13:41,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:13:41,750 INFO L87 Difference]: Start difference. First operand 692 states and 808 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:43,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:43,137 INFO L93 Difference]: Finished difference Result 874 states and 968 transitions. [2024-10-14 19:13:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:13:43,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-14 19:13:43,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:43,141 INFO L225 Difference]: With dead ends: 874 [2024-10-14 19:13:43,141 INFO L226 Difference]: Without dead ends: 874 [2024-10-14 19:13:43,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-14 19:13:43,141 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 315 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:43,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1090 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:13:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-10-14 19:13:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 688. [2024-10-14 19:13:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 440 states have (on average 1.8136363636363637) internal successors, (798), 683 states have internal predecessors, (798), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 804 transitions. [2024-10-14 19:13:43,151 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 804 transitions. Word has length 32 [2024-10-14 19:13:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:43,151 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 804 transitions. [2024-10-14 19:13:43,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 804 transitions. [2024-10-14 19:13:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 19:13:43,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:43,154 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] [2024-10-14 19:13:43,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-14 19:13:43,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:43,355 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:43,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:43,355 INFO L85 PathProgramCache]: Analyzing trace with hash 742661342, now seen corresponding path program 1 times [2024-10-14 19:13:43,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:43,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905192142] [2024-10-14 19:13:43,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:43,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:43,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:43,360 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:43,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 19:13:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:43,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:13:43,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:43,522 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-14 19:13:43,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:43,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:43,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905192142] [2024-10-14 19:13:43,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905192142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:43,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:43,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:13:43,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724425030] [2024-10-14 19:13:43,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:43,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:13:43,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:43,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:13:43,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:13:43,524 INFO L87 Difference]: Start difference. First operand 688 states and 804 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:43,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:43,966 INFO L93 Difference]: Finished difference Result 676 states and 784 transitions. [2024-10-14 19:13:43,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:13:43,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-10-14 19:13:43,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:43,970 INFO L225 Difference]: With dead ends: 676 [2024-10-14 19:13:43,970 INFO L226 Difference]: Without dead ends: 676 [2024-10-14 19:13:43,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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-14 19:13:43,970 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 21 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:43,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1468 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 19:13:43,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-10-14 19:13:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2024-10-14 19:13:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 428 states have (on average 1.8177570093457944) internal successors, (778), 671 states have internal predecessors, (778), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 784 transitions. [2024-10-14 19:13:43,979 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 784 transitions. Word has length 43 [2024-10-14 19:13:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:43,979 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 784 transitions. [2024-10-14 19:13:43,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:43,980 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 784 transitions. [2024-10-14 19:13:43,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 19:13:43,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:43,981 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-14 19:13:43,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-14 19:13:44,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:44,181 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:44,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:44,182 INFO L85 PathProgramCache]: Analyzing trace with hash -850764706, now seen corresponding path program 1 times [2024-10-14 19:13:44,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:44,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838038096] [2024-10-14 19:13:44,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:44,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:44,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:44,183 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:44,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-14 19:13:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:44,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:13:44,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:44,486 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-14 19:13:44,486 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:44,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:44,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838038096] [2024-10-14 19:13:44,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838038096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:44,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:44,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:13:44,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825494049] [2024-10-14 19:13:44,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:44,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:13:44,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:44,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:13:44,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:13:44,488 INFO L87 Difference]: Start difference. First operand 676 states and 784 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 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-14 19:13:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:44,919 INFO L93 Difference]: Finished difference Result 753 states and 822 transitions. [2024-10-14 19:13:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:13:44,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 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-14 19:13:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:44,922 INFO L225 Difference]: With dead ends: 753 [2024-10-14 19:13:44,922 INFO L226 Difference]: Without dead ends: 753 [2024-10-14 19:13:44,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-14 19:13:44,923 INFO L432 NwaCegarLoop]: 518 mSDtfsCounter, 69 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:44,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 985 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 19:13:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-10-14 19:13:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 743. [2024-10-14 19:13:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 495 states have (on average 1.6404040404040403) internal successors, (812), 738 states have internal predecessors, (812), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 818 transitions. [2024-10-14 19:13:44,931 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 818 transitions. Word has length 47 [2024-10-14 19:13:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:44,931 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 818 transitions. [2024-10-14 19:13:44,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 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-14 19:13:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 818 transitions. [2024-10-14 19:13:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 19:13:44,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:44,932 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-14 19:13:44,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-14 19:13:45,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:45,133 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:45,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:45,133 INFO L85 PathProgramCache]: Analyzing trace with hash -884394085, now seen corresponding path program 1 times [2024-10-14 19:13:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636456678] [2024-10-14 19:13:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:45,134 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-14 19:13:45,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:45,135 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:45,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-14 19:13:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:45,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:13:45,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:45,345 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-14 19:13:45,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:45,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:45,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636456678] [2024-10-14 19:13:45,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636456678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:45,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:45,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:13:45,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912832963] [2024-10-14 19:13:45,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:45,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:13:45,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:45,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:13:45,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:13:45,347 INFO L87 Difference]: Start difference. First operand 743 states and 818 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-14 19:13:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:45,742 INFO L93 Difference]: Finished difference Result 731 states and 798 transitions. [2024-10-14 19:13:45,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:13:45,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-14 19:13:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:45,746 INFO L225 Difference]: With dead ends: 731 [2024-10-14 19:13:45,746 INFO L226 Difference]: Without dead ends: 731 [2024-10-14 19:13:45,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-14 19:13:45,747 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 15 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:45,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1462 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 19:13:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-14 19:13:45,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2024-10-14 19:13:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 483 states have (on average 1.639751552795031) internal successors, (792), 726 states have internal predecessors, (792), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:45,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 798 transitions. [2024-10-14 19:13:45,756 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 798 transitions. Word has length 51 [2024-10-14 19:13:45,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:45,756 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 798 transitions. [2024-10-14 19:13:45,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-14 19:13:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 798 transitions. [2024-10-14 19:13:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 19:13:45,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:45,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:13:45,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-14 19:13:45,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:45,958 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:45,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1575839013, now seen corresponding path program 1 times [2024-10-14 19:13:45,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:45,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209982606] [2024-10-14 19:13:45,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:45,959 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-14 19:13:45,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:45,960 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:45,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-14 19:13:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:46,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 19:13:46,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:46,164 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:13:46,165 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:13:46,165 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:13:46,168 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 30 treesize of output 39 [2024-10-14 19:13:46,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:13:46,223 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 70 treesize of output 26 [2024-10-14 19:13:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:13:46,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:46,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:46,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209982606] [2024-10-14 19:13:46,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209982606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:46,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:46,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:13:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84442810] [2024-10-14 19:13:46,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:46,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:13:46,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:46,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:13:46,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:13:46,266 INFO L87 Difference]: Start difference. First operand 731 states and 798 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:47,243 INFO L93 Difference]: Finished difference Result 1159 states and 1247 transitions. [2024-10-14 19:13:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:13:47,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-14 19:13:47,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:47,246 INFO L225 Difference]: With dead ends: 1159 [2024-10-14 19:13:47,246 INFO L226 Difference]: Without dead ends: 1156 [2024-10-14 19:13:47,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:13:47,247 INFO L432 NwaCegarLoop]: 670 mSDtfsCounter, 1403 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:47,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 2484 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 19:13:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-10-14 19:13:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 682. [2024-10-14 19:13:47,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 434 states have (on average 1.707373271889401) internal successors, (741), 677 states have internal predecessors, (741), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 747 transitions. [2024-10-14 19:13:47,258 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 747 transitions. Word has length 53 [2024-10-14 19:13:47,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:47,258 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 747 transitions. [2024-10-14 19:13:47,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 747 transitions. [2024-10-14 19:13:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 19:13:47,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:47,259 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] [2024-10-14 19:13:47,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-14 19:13:47,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:47,459 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:47,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash -524703463, now seen corresponding path program 1 times [2024-10-14 19:13:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:47,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327868192] [2024-10-14 19:13:47,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:47,460 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-14 19:13:47,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:47,462 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:47,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-14 19:13:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:47,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 19:13:47,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:47,781 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-14 19:13:47,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:13:48,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:13:48,166 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-14 19:13:48,178 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:13:48,178 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-14 19:13:48,187 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-14 19:13:48,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:48,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327868192] [2024-10-14 19:13:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327868192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:48,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:48,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:13:48,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958300532] [2024-10-14 19:13:48,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:48,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:13:48,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:48,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:13:48,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:13:48,188 INFO L87 Difference]: Start difference. First operand 682 states and 747 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:48,994 INFO L93 Difference]: Finished difference Result 644 states and 709 transitions. [2024-10-14 19:13:48,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:13:48,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-14 19:13:48,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:48,996 INFO L225 Difference]: With dead ends: 644 [2024-10-14 19:13:48,996 INFO L226 Difference]: Without dead ends: 644 [2024-10-14 19:13:48,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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-14 19:13:48,996 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 469 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:48,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 161 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 19:13:48,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-10-14 19:13:49,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 617. [2024-10-14 19:13:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 407 states have (on average 1.57002457002457) internal successors, (639), 612 states have internal predecessors, (639), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 645 transitions. [2024-10-14 19:13:49,006 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 645 transitions. Word has length 55 [2024-10-14 19:13:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:49,007 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 645 transitions. [2024-10-14 19:13:49,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 645 transitions. [2024-10-14 19:13:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 19:13:49,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:49,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:13:49,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-14 19:13:49,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:49,209 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:49,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:49,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1791717534, now seen corresponding path program 1 times [2024-10-14 19:13:49,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:49,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277633905] [2024-10-14 19:13:49,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:49,209 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-14 19:13:49,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:49,211 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:49,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-14 19:13:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:49,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:13:49,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:49,438 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-14 19:13:49,447 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-14 19:13:49,461 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-14 19:13:49,467 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-14 19:13:49,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:49,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:49,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277633905] [2024-10-14 19:13:49,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277633905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:49,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:49,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:13:49,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802952089] [2024-10-14 19:13:49,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:49,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:13:49,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:49,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:13:49,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:13:49,469 INFO L87 Difference]: Start difference. First operand 617 states and 645 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:50,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:50,531 INFO L93 Difference]: Finished difference Result 616 states and 644 transitions. [2024-10-14 19:13:50,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:13:50,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-14 19:13:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:50,533 INFO L225 Difference]: With dead ends: 616 [2024-10-14 19:13:50,533 INFO L226 Difference]: Without dead ends: 616 [2024-10-14 19:13:50,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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-14 19:13:50,534 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 2 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:50,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1235 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 19:13:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-10-14 19:13:50,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2024-10-14 19:13:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 407 states have (on average 1.5675675675675675) internal successors, (638), 611 states have internal predecessors, (638), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 644 transitions. [2024-10-14 19:13:50,541 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 644 transitions. Word has length 59 [2024-10-14 19:13:50,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:50,541 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 644 transitions. [2024-10-14 19:13:50,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:50,541 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 644 transitions. [2024-10-14 19:13:50,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 19:13:50,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:50,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:13:50,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-14 19:13:50,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:50,743 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:50,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:50,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1791717535, now seen corresponding path program 1 times [2024-10-14 19:13:50,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:50,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624867406] [2024-10-14 19:13:50,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:50,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:50,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:50,745 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:50,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-14 19:13:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:50,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 19:13:50,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:50,975 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-14 19:13:50,987 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-14 19:13:50,990 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-14 19:13:51,014 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-14 19:13:51,025 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-14 19:13:51,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:51,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:51,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624867406] [2024-10-14 19:13:51,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624867406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:51,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:51,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:13:51,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369508010] [2024-10-14 19:13:51,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:51,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:13:51,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:51,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:13:51,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:13:51,027 INFO L87 Difference]: Start difference. First operand 616 states and 644 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:52,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:52,575 INFO L93 Difference]: Finished difference Result 615 states and 643 transitions. [2024-10-14 19:13:52,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:13:52,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-14 19:13:52,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:52,578 INFO L225 Difference]: With dead ends: 615 [2024-10-14 19:13:52,578 INFO L226 Difference]: Without dead ends: 615 [2024-10-14 19:13:52,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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-14 19:13:52,579 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 1 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:52,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1240 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:13:52,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-10-14 19:13:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2024-10-14 19:13:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 406 states have (on average 1.5689655172413792) internal successors, (637), 610 states have internal predecessors, (637), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:13:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 643 transitions. [2024-10-14 19:13:52,586 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 643 transitions. Word has length 59 [2024-10-14 19:13:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:52,587 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 643 transitions. [2024-10-14 19:13:52,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:13:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 643 transitions. [2024-10-14 19:13:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 19:13:52,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:52,588 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-14 19:13:52,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-10-14 19:13:52,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:52,788 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:52,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:52,789 INFO L85 PathProgramCache]: Analyzing trace with hash 668079778, now seen corresponding path program 1 times [2024-10-14 19:13:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:52,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967360180] [2024-10-14 19:13:52,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:52,789 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-14 19:13:52,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:52,791 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:52,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-14 19:13:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:53,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:13:53,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:53,028 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-14 19:13:53,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:13:53,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:53,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967360180] [2024-10-14 19:13:53,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967360180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:13:53,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:13:53,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:13:53,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013158099] [2024-10-14 19:13:53,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:13:53,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:13:53,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:53,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:13:53,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:13:53,030 INFO L87 Difference]: Start difference. First operand 615 states and 643 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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-14 19:13:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:53,458 INFO L93 Difference]: Finished difference Result 617 states and 646 transitions. [2024-10-14 19:13:53,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:13:53,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2024-10-14 19:13:53,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:53,462 INFO L225 Difference]: With dead ends: 617 [2024-10-14 19:13:53,462 INFO L226 Difference]: Without dead ends: 617 [2024-10-14 19:13:53,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 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-14 19:13:53,463 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 0 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:53,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1398 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 19:13:53,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-10-14 19:13:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2024-10-14 19:13:53,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 407 states have (on average 1.57002457002457) internal successors, (639), 612 states have internal predecessors, (639), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:13:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 646 transitions. [2024-10-14 19:13:53,470 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 646 transitions. Word has length 65 [2024-10-14 19:13:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:53,471 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 646 transitions. [2024-10-14 19:13:53,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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-14 19:13:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 646 transitions. [2024-10-14 19:13:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 19:13:53,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:53,471 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, 1] [2024-10-14 19:13:53,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-10-14 19:13:53,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:53,672 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:53,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:53,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1578145625, now seen corresponding path program 1 times [2024-10-14 19:13:53,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:53,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009787066] [2024-10-14 19:13:53,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:13:53,673 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-14 19:13:53,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:53,676 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:53,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-14 19:13:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:13:53,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:13:53,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:53,931 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-14 19:13:53,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:13:53,994 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-14 19:13:53,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:53,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009787066] [2024-10-14 19:13:53,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009787066] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:13:53,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:13:53,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 19:13:53,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679097529] [2024-10-14 19:13:53,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:13:53,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:13:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:53,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:13:53,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:13:53,997 INFO L87 Difference]: Start difference. First operand 617 states and 646 transitions. Second operand has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:13:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:54,694 INFO L93 Difference]: Finished difference Result 626 states and 660 transitions. [2024-10-14 19:13:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:13:54,695 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2024-10-14 19:13:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:54,696 INFO L225 Difference]: With dead ends: 626 [2024-10-14 19:13:54,696 INFO L226 Difference]: Without dead ends: 626 [2024-10-14 19:13:54,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 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-14 19:13:54,697 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 5 mSDsluCounter, 1857 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:54,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2323 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 19:13:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-10-14 19:13:54,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 625. [2024-10-14 19:13:54,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 414 states have (on average 1.5748792270531402) internal successors, (652), 619 states have internal predecessors, (652), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:13:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 659 transitions. [2024-10-14 19:13:54,706 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 659 transitions. Word has length 66 [2024-10-14 19:13:54,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:54,706 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 659 transitions. [2024-10-14 19:13:54,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:13:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 659 transitions. [2024-10-14 19:13:54,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 19:13:54,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:54,707 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, 1] [2024-10-14 19:13:54,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-10-14 19:13:54,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:54,908 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:54,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:54,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1838739426, now seen corresponding path program 2 times [2024-10-14 19:13:54,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:54,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506229697] [2024-10-14 19:13:54,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:13:54,909 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-14 19:13:54,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:54,910 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:54,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-14 19:13:55,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:13:55,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:13:55,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:13:55,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:55,352 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-14 19:13:55,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:13:55,453 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-14 19:13:55,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:55,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506229697] [2024-10-14 19:13:55,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506229697] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:13:55,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:13:55,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 19:13:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743908530] [2024-10-14 19:13:55,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:13:55,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 19:13:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:55,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 19:13:55,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 19:13:55,455 INFO L87 Difference]: Start difference. First operand 625 states and 659 transitions. Second operand has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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-14 19:13:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:13:56,816 INFO L93 Difference]: Finished difference Result 637 states and 678 transitions. [2024-10-14 19:13:56,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 19:13:56,817 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-10-14 19:13:56,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:13:56,819 INFO L225 Difference]: With dead ends: 637 [2024-10-14 19:13:56,819 INFO L226 Difference]: Without dead ends: 635 [2024-10-14 19:13:56,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 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-14 19:13:56,822 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 7 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3718 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:13:56,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3718 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 19:13:56,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-10-14 19:13:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 634. [2024-10-14 19:13:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 423 states have (on average 1.5697399527186762) internal successors, (664), 628 states have internal predecessors, (664), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:13:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 671 transitions. [2024-10-14 19:13:56,830 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 671 transitions. Word has length 69 [2024-10-14 19:13:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:13:56,831 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 671 transitions. [2024-10-14 19:13:56,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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-14 19:13:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 671 transitions. [2024-10-14 19:13:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 19:13:56,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:13:56,831 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, 1] [2024-10-14 19:13:56,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-10-14 19:13:57,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:13:57,032 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:13:57,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:13:57,033 INFO L85 PathProgramCache]: Analyzing trace with hash 369150402, now seen corresponding path program 3 times [2024-10-14 19:13:57,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:13:57,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998160745] [2024-10-14 19:13:57,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:13:57,033 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-14 19:13:57,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:13:57,034 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:13:57,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-14 19:13:57,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-14 19:13:57,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:13:57,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 19:13:57,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:13:57,816 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-14 19:13:57,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:13:58,266 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-14 19:13:58,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:13:58,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998160745] [2024-10-14 19:13:58,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998160745] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:13:58,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:13:58,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 19:13:58,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611642362] [2024-10-14 19:13:58,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:13:58,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 19:13:58,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:13:58,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 19:13:58,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 19:13:58,269 INFO L87 Difference]: Start difference. First operand 634 states and 671 transitions. Second operand has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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-14 19:14:01,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:14:01,115 INFO L93 Difference]: Finished difference Result 655 states and 707 transitions. [2024-10-14 19:14:01,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 19:14:01,115 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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 75 [2024-10-14 19:14:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:14:01,117 INFO L225 Difference]: With dead ends: 655 [2024-10-14 19:14:01,117 INFO L226 Difference]: Without dead ends: 652 [2024-10-14 19:14:01,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 124 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-14 19:14:01,119 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 14 mSDsluCounter, 5113 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5579 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:14:01,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5579 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 19:14:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-10-14 19:14:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2024-10-14 19:14:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 441 states have (on average 1.5578231292517006) internal successors, (687), 646 states have internal predecessors, (687), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:14:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 694 transitions. [2024-10-14 19:14:01,127 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 694 transitions. Word has length 75 [2024-10-14 19:14:01,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:14:01,127 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 694 transitions. [2024-10-14 19:14:01,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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-14 19:14:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 694 transitions. [2024-10-14 19:14:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 19:14:01,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:14:01,128 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, 1] [2024-10-14 19:14:01,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-10-14 19:14:01,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:14:01,329 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:14:01,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:14:01,330 INFO L85 PathProgramCache]: Analyzing trace with hash 266716546, now seen corresponding path program 4 times [2024-10-14 19:14:01,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:14:01,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644462355] [2024-10-14 19:14:01,330 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:14:01,330 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-14 19:14:01,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:14:01,331 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:14:01,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-10-14 19:14:01,764 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:14:01,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:14:01,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 19:14:01,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:14:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:14:02,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:14:03,257 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-14 19:14:03,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:14:03,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644462355] [2024-10-14 19:14:03,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644462355] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:14:03,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:14:03,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 19:14:03,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22164056] [2024-10-14 19:14:03,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:14:03,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 19:14:03,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:14:03,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 19:14:03,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 19:14:03,260 INFO L87 Difference]: Start difference. First operand 652 states and 694 transitions. Second operand has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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-14 19:14:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:14:10,171 INFO L93 Difference]: Finished difference Result 689 states and 763 transitions. [2024-10-14 19:14:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 19:14:10,172 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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 87 [2024-10-14 19:14:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:14:10,174 INFO L225 Difference]: With dead ends: 689 [2024-10-14 19:14:10,174 INFO L226 Difference]: Without dead ends: 687 [2024-10-14 19:14:10,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 19:14:10,176 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 26 mSDsluCounter, 11623 mSDsCounter, 0 mSdLazyCounter, 3512 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12089 SdHoareTripleChecker+Invalid, 3578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:14:10,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 12089 Invalid, 3578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3512 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-14 19:14:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-10-14 19:14:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 686. [2024-10-14 19:14:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 475 states have (on average 1.543157894736842) internal successors, (733), 680 states have internal predecessors, (733), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:14:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 740 transitions. [2024-10-14 19:14:10,184 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 740 transitions. Word has length 87 [2024-10-14 19:14:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:14:10,184 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 740 transitions. [2024-10-14 19:14:10,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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-14 19:14:10,184 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 740 transitions. [2024-10-14 19:14:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 19:14:10,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:14:10,185 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, 1] [2024-10-14 19:14:10,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2024-10-14 19:14:10,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:14:10,390 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-10-14 19:14:10,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:14:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash -112653214, now seen corresponding path program 5 times [2024-10-14 19:14:10,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:14:10,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984916422] [2024-10-14 19:14:10,391 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:14:10,391 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-14 19:14:10,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:14:10,392 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:14:10,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-10-14 19:14:11,389 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:14:11,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:14:11,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-14 19:14:11,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:14:11,421 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-14 19:14:11,505 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 19:14:11,505 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-14 19:14:11,525 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-14 19:14:11,600 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-14 19:14:12,329 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 19:14:12,329 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-14 19:14:12,361 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-14 19:14:12,382 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-14 19:14:12,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:14:12,669 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2161) |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-14 19:14:12,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:14:12,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984916422] [2024-10-14 19:14:12,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984916422] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:14:12,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [281269191] [2024-10-14 19:14:12,671 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:14:12,672 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 19:14:12,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 19:14:12,673 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 19:14:12,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-10-14 19:14:13,154 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:14:13,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:14:13,195 WARN L253 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 618 conjuncts are in the unsatisfiable core [2024-10-14 19:14:13,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:14:13,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 19:14:13,246 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-14 19:14:13,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:14:13,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:14:13,292 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:14:13,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-14 19:14:13,391 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-14 19:14:13,419 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 19:14:13,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-10-14 19:14:13,636 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 8 treesize of output 1 [2024-10-14 19:14:13,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:14:13,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:14:13,647 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:14:13,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 121 [2024-10-14 19:14:13,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 91 [2024-10-14 19:14:13,987 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:14:13,988 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:14:13,988 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:14:13,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 205 [2024-10-14 19:14:14,016 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 8 treesize of output 1 [2024-10-14 19:14:30,456 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 8 treesize of output 1 [2024-10-14 19:14:30,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 149885 treesize of output 118989 [2024-10-14 19:14:30,855 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 8 treesize of output 1