./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:12:27,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:12:27,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:12:27,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:12:27,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:12:27,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:12:27,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:12:27,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:12:27,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:12:27,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:12:27,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:12:27,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:12:27,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:12:27,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:12:27,800 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:12:27,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:12:27,800 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:12:27,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:12:27,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:12:27,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:12:27,801 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:12:27,801 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:12:27,802 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:12:27,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:12:27,802 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:12:27,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:12:27,802 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:12:27,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:12:27,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:12:27,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:12:27,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:12:27,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:12:27,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:12:27,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:12:27,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:12:27,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:12:27,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:12:27,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:12:27,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:12:27,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:12:27,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:12:27,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:12:27,806 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 [2024-10-11 19:12:28,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:12:28,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:12:28,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:12:28,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:12:28,062 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:12:28,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-2.i [2024-10-11 19:12:29,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:12:29,583 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:12:29,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-2.i [2024-10-11 19:12:29,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/52bdb8552/6423faa3fd8a42cc952ecd907d8a6914/FLAGd2ee38435 [2024-10-11 19:12:29,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/52bdb8552/6423faa3fd8a42cc952ecd907d8a6914 [2024-10-11 19:12:29,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:12:29,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:12:29,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:12:29,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:12:29,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:12:29,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:12:29" (1/1) ... [2024-10-11 19:12:29,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2fd4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:29, skipping insertion in model container [2024-10-11 19:12:29,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:12:29" (1/1) ... [2024-10-11 19:12:29,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:12:30,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:12:30,129 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 19:12:30,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@47307ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:30, skipping insertion in model container [2024-10-11 19:12:30,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:12:30,130 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:12:30,131 INFO L158 Benchmark]: Toolchain (without parser) took 457.60ms. Allocated memory is still 165.7MB. Free memory was 136.5MB in the beginning and 114.0MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 19:12:30,132 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 165.7MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:12:30,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.96ms. Allocated memory is still 165.7MB. Free memory was 136.5MB in the beginning and 114.0MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 19:12:30,133 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.16ms. Allocated memory is still 165.7MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.96ms. Allocated memory is still 165.7MB. Free memory was 136.5MB in the beginning and 114.0MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 740]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:12:32,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:12:32,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:12:32,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:12:32,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:12:32,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:12:32,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:12:32,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:12:32,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:12:32,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:12:32,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:12:32,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:12:32,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:12:32,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:12:32,335 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:12:32,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:12:32,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:12:32,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:12:32,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:12:32,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:12:32,341 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:12:32,342 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:12:32,342 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:12:32,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:12:32,343 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:12:32,344 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:12:32,344 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:12:32,344 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:12:32,344 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:12:32,345 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:12:32,345 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:12:32,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:12:32,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:12:32,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:12:32,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:12:32,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:12:32,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:12:32,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:12:32,347 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:12:32,347 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:12:32,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:12:32,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:12:32,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:12:32,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:12:32,348 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:12:32,348 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 [2024-10-11 19:12:32,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:12:32,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:12:32,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:12:32,703 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:12:32,704 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:12:32,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-2.i [2024-10-11 19:12:34,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:12:34,355 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:12:34,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-2.i [2024-10-11 19:12:34,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/289e227fc/4459658115af4edd96ccf63c209c120d/FLAGe3c994c51 [2024-10-11 19:12:34,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/289e227fc/4459658115af4edd96ccf63c209c120d [2024-10-11 19:12:34,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:12:34,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:12:34,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:12:34,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:12:34,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:12:34,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:12:34" (1/1) ... [2024-10-11 19:12:34,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b008e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:34, skipping insertion in model container [2024-10-11 19:12:34,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:12:34" (1/1) ... [2024-10-11 19:12:34,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:12:34,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:12:34,991 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:12:35,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:12:35,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:12:35,114 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:12:35,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:12:35,242 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:12:35,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:35 WrapperNode [2024-10-11 19:12:35,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:12:35,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:12:35,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:12:35,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:12:35,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:35" (1/1) ... [2024-10-11 19:12:35,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:35" (1/1) ... [2024-10-11 19:12:35,348 INFO L138 Inliner]: procedures = 179, calls = 377, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1311 [2024-10-11 19:12:35,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:12:35,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:12:35,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:12:35,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:12:35,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:35" (1/1) ... [2024-10-11 19:12:35,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:35" (1/1) ... [2024-10-11 19:12:35,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:35" (1/1) ... [2024-10-11 19:12:35,486 INFO L175 MemorySlicer]: Split 357 memory accesses to 2 slices as follows [2, 355]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 90 writes are split as follows [0, 90]. [2024-10-11 19:12:35,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:35" (1/1) ... [2024-10-11 19:12:35,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:35" (1/1) ... [2024-10-11 19:12:35,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:35" (1/1) ... [2024-10-11 19:12:35,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:35" (1/1) ... [2024-10-11 19:12:35,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:35" (1/1) ... [2024-10-11 19:12:35,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:35" (1/1) ... [2024-10-11 19:12:35,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:12:35,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:12:35,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:12:35,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:12:35,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:35" (1/1) ... [2024-10-11 19:12:35,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:12:35,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:12:35,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:12:35,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:12:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:12:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:12:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:12:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:12:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:12:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:12:35,651 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:12:35,651 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:12:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:12:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:12:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:12:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:12:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:12:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:12:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:12:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:12:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:12:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:12:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:12:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:12:35,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:12:35,873 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:12:35,875 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:12:35,877 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:12:35,918 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:12:39,560 INFO L? ?]: Removed 1538 outVars from TransFormulas that were not future-live. [2024-10-11 19:12:39,561 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:12:39,805 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:12:39,805 INFO L314 CfgBuilder]: Removed 69 assume(true) statements. [2024-10-11 19:12:39,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:12:39 BoogieIcfgContainer [2024-10-11 19:12:39,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:12:39,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:12:39,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:12:39,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:12:39,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:12:34" (1/3) ... [2024-10-11 19:12:39,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be81a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:12:39, skipping insertion in model container [2024-10-11 19:12:39,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:35" (2/3) ... [2024-10-11 19:12:39,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be81a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:12:39, skipping insertion in model container [2024-10-11 19:12:39,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:12:39" (3/3) ... [2024-10-11 19:12:39,813 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test4-2.i [2024-10-11 19:12:39,826 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:12:39,827 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 733 error locations. [2024-10-11 19:12:39,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:12:39,890 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;@58d8e7f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:12:39,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 733 error locations. [2024-10-11 19:12:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 1292 states, 557 states have (on average 2.556552962298025) internal successors, (1424), 1284 states have internal predecessors, (1424), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:12:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 19:12:39,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:39,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 19:12:39,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr732ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:12:39,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:39,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2086279, now seen corresponding path program 1 times [2024-10-11 19:12:39,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:39,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236260542] [2024-10-11 19:12:39,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:39,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:39,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:39,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:12:39,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 19:12:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:40,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:12:40,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:12:40,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:40,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:40,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236260542] [2024-10-11 19:12:40,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236260542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:40,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:40,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:12:40,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726008325] [2024-10-11 19:12:40,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:40,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:40,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:40,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:40,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:40,073 INFO L87 Difference]: Start difference. First operand has 1292 states, 557 states have (on average 2.556552962298025) internal successors, (1424), 1284 states have internal predecessors, (1424), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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-11 19:12:42,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:42,242 INFO L93 Difference]: Finished difference Result 1463 states and 1542 transitions. [2024-10-11 19:12:42,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:42,245 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-11 19:12:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:42,259 INFO L225 Difference]: With dead ends: 1463 [2024-10-11 19:12:42,259 INFO L226 Difference]: Without dead ends: 1460 [2024-10-11 19:12:42,260 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-11 19:12:42,262 INFO L432 NwaCegarLoop]: 1124 mSDtfsCounter, 200 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:42,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1743 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 19:12:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2024-10-11 19:12:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1287. [2024-10-11 19:12:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 563 states have (on average 2.403197158081705) internal successors, (1353), 1279 states have internal predecessors, (1353), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:12:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1365 transitions. [2024-10-11 19:12:42,329 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1365 transitions. Word has length 3 [2024-10-11 19:12:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:42,329 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1365 transitions. [2024-10-11 19:12:42,330 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-11 19:12:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1365 transitions. [2024-10-11 19:12:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 19:12:42,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:42,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 19:12:42,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 19:12:42,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:42,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:12:42,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:42,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2002971235, now seen corresponding path program 1 times [2024-10-11 19:12:42,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:42,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362359628] [2024-10-11 19:12:42,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:42,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:42,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:42,538 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:12:42,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 19:12:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:42,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:12:42,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:42,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:12:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:12:42,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:42,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:42,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362359628] [2024-10-11 19:12:42,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362359628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:42,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:42,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:12:42,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930733672] [2024-10-11 19:12:42,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:42,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:42,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:42,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:42,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:42,735 INFO L87 Difference]: Start difference. First operand 1287 states and 1365 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:44,147 INFO L93 Difference]: Finished difference Result 1193 states and 1269 transitions. [2024-10-11 19:12:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:44,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 19:12:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:44,155 INFO L225 Difference]: With dead ends: 1193 [2024-10-11 19:12:44,155 INFO L226 Difference]: Without dead ends: 1193 [2024-10-11 19:12:44,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:44,156 INFO L432 NwaCegarLoop]: 614 mSDtfsCounter, 913 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:44,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 704 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 19:12:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-10-11 19:12:44,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1193. [2024-10-11 19:12:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 563 states have (on average 2.2326820603907636) internal successors, (1257), 1185 states have internal predecessors, (1257), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:12:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1269 transitions. [2024-10-11 19:12:44,213 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1269 transitions. Word has length 5 [2024-10-11 19:12:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:44,214 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1269 transitions. [2024-10-11 19:12:44,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1269 transitions. [2024-10-11 19:12:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 19:12:44,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:44,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 19:12:44,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 19:12:44,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:44,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:12:44,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:44,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2002971236, now seen corresponding path program 1 times [2024-10-11 19:12:44,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:44,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661658559] [2024-10-11 19:12:44,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:44,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:44,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:44,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:12:44,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 19:12:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:44,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:12:44,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:44,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:12:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:12:44,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:44,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:44,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661658559] [2024-10-11 19:12:44,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661658559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:44,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:44,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:12:44,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24459916] [2024-10-11 19:12:44,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:44,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:44,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:44,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:44,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:44,587 INFO L87 Difference]: Start difference. First operand 1193 states and 1269 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:47,020 INFO L93 Difference]: Finished difference Result 1473 states and 1569 transitions. [2024-10-11 19:12:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:47,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 19:12:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:47,025 INFO L225 Difference]: With dead ends: 1473 [2024-10-11 19:12:47,025 INFO L226 Difference]: Without dead ends: 1473 [2024-10-11 19:12:47,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:47,028 INFO L432 NwaCegarLoop]: 920 mSDtfsCounter, 464 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:47,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1354 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 19:12:47,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2024-10-11 19:12:47,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1322. [2024-10-11 19:12:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 702 states have (on average 2.1923076923076925) internal successors, (1539), 1314 states have internal predecessors, (1539), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:12:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1551 transitions. [2024-10-11 19:12:47,049 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1551 transitions. Word has length 5 [2024-10-11 19:12:47,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:47,049 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 1551 transitions. [2024-10-11 19:12:47,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1551 transitions. [2024-10-11 19:12:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 19:12:47,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:47,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:12:47,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 19:12:47,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:47,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:12:47,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:47,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1964225645, now seen corresponding path program 1 times [2024-10-11 19:12:47,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:47,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130557484] [2024-10-11 19:12:47,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:47,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:47,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:47,254 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:12:47,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 19:12:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:47,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:12:47,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:12:47,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:47,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:47,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130557484] [2024-10-11 19:12:47,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130557484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:47,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:47,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:12:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723887243] [2024-10-11 19:12:47,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:47,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:47,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:47,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:47,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:47,412 INFO L87 Difference]: Start difference. First operand 1322 states and 1551 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:49,003 INFO L93 Difference]: Finished difference Result 1999 states and 2354 transitions. [2024-10-11 19:12:49,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:12:49,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 19:12:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:49,010 INFO L225 Difference]: With dead ends: 1999 [2024-10-11 19:12:49,010 INFO L226 Difference]: Without dead ends: 1999 [2024-10-11 19:12:49,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:49,011 INFO L432 NwaCegarLoop]: 1092 mSDtfsCounter, 620 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 3057 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:49,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 3057 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:12:49,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2024-10-11 19:12:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1700. [2024-10-11 19:12:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1080 states have (on average 2.162962962962963) internal successors, (2336), 1689 states have internal predecessors, (2336), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:12:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2354 transitions. [2024-10-11 19:12:49,058 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2354 transitions. Word has length 6 [2024-10-11 19:12:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:49,058 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2354 transitions. [2024-10-11 19:12:49,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2354 transitions. [2024-10-11 19:12:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 19:12:49,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:49,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:49,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 19:12:49,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:49,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr627REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:12:49,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:49,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2130237079, now seen corresponding path program 1 times [2024-10-11 19:12:49,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:49,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131238010] [2024-10-11 19:12:49,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:49,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:49,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:49,265 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:12:49,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 19:12:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:49,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:12:49,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:12:49,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:49,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:49,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131238010] [2024-10-11 19:12:49,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131238010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:49,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:49,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:12:49,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219069973] [2024-10-11 19:12:49,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:49,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:49,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:49,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:49,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:49,387 INFO L87 Difference]: Start difference. First operand 1700 states and 2354 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-11 19:12:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:50,311 INFO L93 Difference]: Finished difference Result 1789 states and 2307 transitions. [2024-10-11 19:12:50,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:50,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-11 19:12:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:50,317 INFO L225 Difference]: With dead ends: 1789 [2024-10-11 19:12:50,317 INFO L226 Difference]: Without dead ends: 1789 [2024-10-11 19:12:50,317 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-11 19:12:50,318 INFO L432 NwaCegarLoop]: 1144 mSDtfsCounter, 285 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:50,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 2175 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 19:12:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2024-10-11 19:12:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1589. [2024-10-11 19:12:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 969 states have (on average 2.1733746130030958) internal successors, (2106), 1578 states have internal predecessors, (2106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:12:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2124 transitions. [2024-10-11 19:12:50,340 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2124 transitions. Word has length 8 [2024-10-11 19:12:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:50,340 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2124 transitions. [2024-10-11 19:12:50,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-11 19:12:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2124 transitions. [2024-10-11 19:12:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 19:12:50,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:50,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:50,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 19:12:50,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:50,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:12:50,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:50,542 INFO L85 PathProgramCache]: Analyzing trace with hash -463868595, now seen corresponding path program 1 times [2024-10-11 19:12:50,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:50,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21647623] [2024-10-11 19:12:50,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:50,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:50,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:50,545 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:12:50,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 19:12:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:50,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:12:50,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:12:50,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:50,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:50,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21647623] [2024-10-11 19:12:50,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21647623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:50,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:50,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:12:50,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970686736] [2024-10-11 19:12:50,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:50,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:50,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:50,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:50,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:50,775 INFO L87 Difference]: Start difference. First operand 1589 states and 2124 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:51,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:51,505 INFO L93 Difference]: Finished difference Result 1535 states and 2044 transitions. [2024-10-11 19:12:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:51,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 19:12:51,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:51,511 INFO L225 Difference]: With dead ends: 1535 [2024-10-11 19:12:51,511 INFO L226 Difference]: Without dead ends: 1535 [2024-10-11 19:12:51,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:51,512 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 61 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:51,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2050 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:12:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-10-11 19:12:51,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1535. [2024-10-11 19:12:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 939 states have (on average 2.1576144834930777) internal successors, (2026), 1524 states have internal predecessors, (2026), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:12:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2044 transitions. [2024-10-11 19:12:51,529 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2044 transitions. Word has length 11 [2024-10-11 19:12:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:51,530 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2044 transitions. [2024-10-11 19:12:51,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:51,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2044 transitions. [2024-10-11 19:12:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 19:12:51,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:51,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:51,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 19:12:51,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:51,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr629REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:12:51,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash -536402057, now seen corresponding path program 1 times [2024-10-11 19:12:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:51,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317063795] [2024-10-11 19:12:51,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:51,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:51,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:51,736 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:12:51,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 19:12:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:51,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:12:51,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:12:51,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:51,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:51,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317063795] [2024-10-11 19:12:51,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317063795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:51,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:51,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:12:51,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340429362] [2024-10-11 19:12:51,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:51,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:51,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:51,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:51,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:51,896 INFO L87 Difference]: Start difference. First operand 1535 states and 2044 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:53,487 INFO L93 Difference]: Finished difference Result 1711 states and 2226 transitions. [2024-10-11 19:12:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:12:53,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 19:12:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:53,495 INFO L225 Difference]: With dead ends: 1711 [2024-10-11 19:12:53,495 INFO L226 Difference]: Without dead ends: 1705 [2024-10-11 19:12:53,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:12:53,496 INFO L432 NwaCegarLoop]: 1107 mSDtfsCounter, 247 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:53,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 3016 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:12:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2024-10-11 19:12:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1529. [2024-10-11 19:12:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 933 states have (on average 2.1639871382636655) internal successors, (2019), 1518 states have internal predecessors, (2019), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:12:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2037 transitions. [2024-10-11 19:12:53,515 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2037 transitions. Word has length 11 [2024-10-11 19:12:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:53,515 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2037 transitions. [2024-10-11 19:12:53,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2037 transitions. [2024-10-11 19:12:53,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 19:12:53,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:53,517 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:53,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 19:12:53,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:53,720 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:12:53,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:53,721 INFO L85 PathProgramCache]: Analyzing trace with hash 898875271, now seen corresponding path program 1 times [2024-10-11 19:12:53,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:53,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763268067] [2024-10-11 19:12:53,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:53,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:53,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:53,724 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:12:53,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 19:12:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:53,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:12:53,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:12:53,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:53,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:53,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763268067] [2024-10-11 19:12:53,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763268067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:53,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:53,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:12:53,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146340570] [2024-10-11 19:12:53,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:53,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:53,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:53,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:53,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:53,911 INFO L87 Difference]: Start difference. First operand 1529 states and 2037 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:54,707 INFO L93 Difference]: Finished difference Result 1513 states and 1993 transitions. [2024-10-11 19:12:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:12:54,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 19:12:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:54,712 INFO L225 Difference]: With dead ends: 1513 [2024-10-11 19:12:54,712 INFO L226 Difference]: Without dead ends: 1513 [2024-10-11 19:12:54,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:12:54,713 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 45 mSDsluCounter, 2012 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3027 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:54,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3027 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:12:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-10-11 19:12:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2024-10-11 19:12:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 931 states have (on average 2.121374865735768) internal successors, (1975), 1502 states have internal predecessors, (1975), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:12:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1993 transitions. [2024-10-11 19:12:54,756 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1993 transitions. Word has length 13 [2024-10-11 19:12:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:54,757 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1993 transitions. [2024-10-11 19:12:54,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:54,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1993 transitions. [2024-10-11 19:12:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 19:12:54,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:54,758 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] [2024-10-11 19:12:54,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 19:12:54,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:54,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:12:54,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:54,960 INFO L85 PathProgramCache]: Analyzing trace with hash 332414229, now seen corresponding path program 1 times [2024-10-11 19:12:54,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:54,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71555952] [2024-10-11 19:12:54,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:54,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:54,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:54,963 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:12:54,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 19:12:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:55,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:12:55,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:55,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:12:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:12:55,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:55,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:55,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71555952] [2024-10-11 19:12:55,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71555952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:55,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:55,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:12:55,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741448144] [2024-10-11 19:12:55,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:55,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:55,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:55,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:55,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:55,196 INFO L87 Difference]: Start difference. First operand 1513 states and 1993 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:57,182 INFO L93 Difference]: Finished difference Result 1517 states and 1993 transitions. [2024-10-11 19:12:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:12:57,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-10-11 19:12:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:57,187 INFO L225 Difference]: With dead ends: 1517 [2024-10-11 19:12:57,187 INFO L226 Difference]: Without dead ends: 1517 [2024-10-11 19:12:57,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:12:57,189 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 857 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:57,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1114 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 19:12:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-10-11 19:12:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1509. [2024-10-11 19:12:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 931 states have (on average 2.112781954887218) internal successors, (1967), 1498 states have internal predecessors, (1967), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:12:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1985 transitions. [2024-10-11 19:12:57,222 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1985 transitions. Word has length 27 [2024-10-11 19:12:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:57,222 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1985 transitions. [2024-10-11 19:12:57,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1985 transitions. [2024-10-11 19:12:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 19:12:57,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:57,223 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] [2024-10-11 19:12:57,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-11 19:12:57,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:57,425 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:12:57,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:57,426 INFO L85 PathProgramCache]: Analyzing trace with hash 332414230, now seen corresponding path program 1 times [2024-10-11 19:12:57,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:57,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144489626] [2024-10-11 19:12:57,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:57,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:57,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:57,431 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:12:57,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 19:12:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:57,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:12:57,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:57,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:12:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:12:57,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:57,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:57,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144489626] [2024-10-11 19:12:57,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144489626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:57,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:57,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:12:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999494476] [2024-10-11 19:12:57,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:57,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:57,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:57,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:57,680 INFO L87 Difference]: Start difference. First operand 1509 states and 1985 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:13:00,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:00,165 INFO L93 Difference]: Finished difference Result 1664 states and 2003 transitions. [2024-10-11 19:13:00,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:13:00,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-10-11 19:13:00,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:00,169 INFO L225 Difference]: With dead ends: 1664 [2024-10-11 19:13:00,169 INFO L226 Difference]: Without dead ends: 1664 [2024-10-11 19:13:00,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:13:00,170 INFO L432 NwaCegarLoop]: 1122 mSDtfsCounter, 404 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:00,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 2169 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 19:13:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2024-10-11 19:13:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1505. [2024-10-11 19:13:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 931 states have (on average 2.104189044038668) internal successors, (1959), 1494 states have internal predecessors, (1959), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:13:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1977 transitions. [2024-10-11 19:13:00,202 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1977 transitions. Word has length 27 [2024-10-11 19:13:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:00,202 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1977 transitions. [2024-10-11 19:13:00,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:13:00,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1977 transitions. [2024-10-11 19:13:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 19:13:00,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:00,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:13:00,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 19:13:00,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:00,404 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:13:00,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash -24905803, now seen corresponding path program 1 times [2024-10-11 19:13:00,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:00,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937943114] [2024-10-11 19:13:00,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:13:00,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:00,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:00,408 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:13:00,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 19:13:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:13:00,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:13:00,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:13:00,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:13:00,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:00,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937943114] [2024-10-11 19:13:00,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937943114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:13:00,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:13:00,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:13:00,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748624754] [2024-10-11 19:13:00,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:13:00,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:13:00,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:00,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:13:00,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:13:00,617 INFO L87 Difference]: Start difference. First operand 1505 states and 1977 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:13:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:01,328 INFO L93 Difference]: Finished difference Result 1493 states and 1957 transitions. [2024-10-11 19:13:01,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:13:01,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-11 19:13:01,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:01,332 INFO L225 Difference]: With dead ends: 1493 [2024-10-11 19:13:01,332 INFO L226 Difference]: Without dead ends: 1493 [2024-10-11 19:13:01,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:13:01,333 INFO L432 NwaCegarLoop]: 1009 mSDtfsCounter, 15 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:01,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3010 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:13:01,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2024-10-11 19:13:01,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1493. [2024-10-11 19:13:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 919 states have (on average 2.1099020674646356) internal successors, (1939), 1482 states have internal predecessors, (1939), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:13:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1957 transitions. [2024-10-11 19:13:01,348 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1957 transitions. Word has length 46 [2024-10-11 19:13:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:01,350 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1957 transitions. [2024-10-11 19:13:01,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:13:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1957 transitions. [2024-10-11 19:13:01,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 19:13:01,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:01,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:13:01,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 19:13:01,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:01,555 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:13:01,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:01,555 INFO L85 PathProgramCache]: Analyzing trace with hash 28068373, now seen corresponding path program 1 times [2024-10-11 19:13:01,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:01,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019679222] [2024-10-11 19:13:01,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:13:01,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:01,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:01,557 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:13:01,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 19:13:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:13:01,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:13:01,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:01,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:13:01,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:13:02,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:13:02,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:13:02,190 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:13:02,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:13:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:13:02,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:13:02,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:02,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019679222] [2024-10-11 19:13:02,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019679222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:13:02,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:13:02,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:13:02,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376213001] [2024-10-11 19:13:02,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:13:02,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:13:02,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:02,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:13:02,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:13:02,210 INFO L87 Difference]: Start difference. First operand 1493 states and 1957 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:13:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:03,817 INFO L93 Difference]: Finished difference Result 1409 states and 1832 transitions. [2024-10-11 19:13:03,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:13:03,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 19:13:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:03,824 INFO L225 Difference]: With dead ends: 1409 [2024-10-11 19:13:03,825 INFO L226 Difference]: Without dead ends: 1409 [2024-10-11 19:13:03,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:13:03,825 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 1564 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:03,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 485 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 19:13:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-10-11 19:13:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1270. [2024-10-11 19:13:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 780 states have (on average 1.9512820512820512) internal successors, (1522), 1259 states have internal predecessors, (1522), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:13:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1540 transitions. [2024-10-11 19:13:03,845 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1540 transitions. Word has length 50 [2024-10-11 19:13:03,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:03,845 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1540 transitions. [2024-10-11 19:13:03,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:13:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1540 transitions. [2024-10-11 19:13:03,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 19:13:03,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:03,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:13:03,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-11 19:13:04,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:04,052 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:13:04,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash -957272213, now seen corresponding path program 1 times [2024-10-11 19:13:04,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:04,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628701712] [2024-10-11 19:13:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:13:04,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:04,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:04,056 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:13:04,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 19:13:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:13:04,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:13:04,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:04,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:13:04,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:13:04,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 19:13:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:13:04,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:13:04,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:04,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628701712] [2024-10-11 19:13:04,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628701712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:13:04,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:13:04,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:13:04,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343183801] [2024-10-11 19:13:04,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:13:04,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:13:04,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:04,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:13:04,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:13:04,360 INFO L87 Difference]: Start difference. First operand 1270 states and 1540 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:13:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:06,760 INFO L93 Difference]: Finished difference Result 1269 states and 1538 transitions. [2024-10-11 19:13:06,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:13:06,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 19:13:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:06,766 INFO L225 Difference]: With dead ends: 1269 [2024-10-11 19:13:06,766 INFO L226 Difference]: Without dead ends: 1269 [2024-10-11 19:13:06,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:13:06,770 INFO L432 NwaCegarLoop]: 937 mSDtfsCounter, 2 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:06,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2370 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 19:13:06,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2024-10-11 19:13:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1269. [2024-10-11 19:13:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 780 states have (on average 1.9487179487179487) internal successors, (1520), 1258 states have internal predecessors, (1520), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:13:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1538 transitions. [2024-10-11 19:13:06,784 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1538 transitions. Word has length 54 [2024-10-11 19:13:06,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:06,784 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 1538 transitions. [2024-10-11 19:13:06,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:13:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1538 transitions. [2024-10-11 19:13:06,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 19:13:06,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:06,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:13:06,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 19:13:06,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:06,991 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:13:06,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:06,992 INFO L85 PathProgramCache]: Analyzing trace with hash -957272212, now seen corresponding path program 1 times [2024-10-11 19:13:06,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:06,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920667688] [2024-10-11 19:13:06,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:13:06,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:06,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:06,994 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:13:06,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 19:13:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:13:07,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:13:07,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:07,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:13:07,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 19:13:07,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:13:07,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-11 19:13:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:13:07,333 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:13:07,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:07,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920667688] [2024-10-11 19:13:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920667688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:13:07,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:13:07,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:13:07,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704751017] [2024-10-11 19:13:07,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:13:07,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:13:07,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:07,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:13:07,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:13:07,334 INFO L87 Difference]: Start difference. First operand 1269 states and 1538 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:13:09,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:09,959 INFO L93 Difference]: Finished difference Result 1268 states and 1536 transitions. [2024-10-11 19:13:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:13:09,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 19:13:09,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:09,962 INFO L225 Difference]: With dead ends: 1268 [2024-10-11 19:13:09,962 INFO L226 Difference]: Without dead ends: 1268 [2024-10-11 19:13:09,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:13:09,963 INFO L432 NwaCegarLoop]: 937 mSDtfsCounter, 1 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1862 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:09,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2399 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1862 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 19:13:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2024-10-11 19:13:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1268. [2024-10-11 19:13:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 778 states have (on average 1.9511568123393317) internal successors, (1518), 1257 states have internal predecessors, (1518), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:13:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1536 transitions. [2024-10-11 19:13:09,988 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1536 transitions. Word has length 54 [2024-10-11 19:13:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:09,988 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1536 transitions. [2024-10-11 19:13:09,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:13:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1536 transitions. [2024-10-11 19:13:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 19:13:09,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:09,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:13:09,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 19:13:10,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:10,190 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:13:10,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:10,191 INFO L85 PathProgramCache]: Analyzing trace with hash 634687919, now seen corresponding path program 1 times [2024-10-11 19:13:10,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:10,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049351831] [2024-10-11 19:13:10,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:13:10,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:10,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:10,194 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:13:10,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 19:13:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:13:10,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:13:10,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:13:10,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:13:10,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049351831] [2024-10-11 19:13:10,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049351831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:13:10,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:13:10,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:13:10,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698761026] [2024-10-11 19:13:10,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:13:10,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:13:10,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:10,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:13:10,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:13:10,470 INFO L87 Difference]: Start difference. First operand 1268 states and 1536 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 19:13:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:11,209 INFO L93 Difference]: Finished difference Result 1270 states and 1541 transitions. [2024-10-11 19:13:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:13:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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 60 [2024-10-11 19:13:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:11,221 INFO L225 Difference]: With dead ends: 1270 [2024-10-11 19:13:11,221 INFO L226 Difference]: Without dead ends: 1270 [2024-10-11 19:13:11,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:13:11,222 INFO L432 NwaCegarLoop]: 936 mSDtfsCounter, 0 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:11,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2802 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:13:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2024-10-11 19:13:11,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1270. [2024-10-11 19:13:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 779 states have (on average 1.951219512195122) internal successors, (1520), 1259 states have internal predecessors, (1520), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 19:13:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1541 transitions. [2024-10-11 19:13:11,263 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1541 transitions. Word has length 60 [2024-10-11 19:13:11,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:11,263 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1541 transitions. [2024-10-11 19:13:11,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 19:13:11,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1541 transitions. [2024-10-11 19:13:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 19:13:11,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:11,264 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] [2024-10-11 19:13:11,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-11 19:13:11,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:11,465 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:13:11,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:11,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1766215004, now seen corresponding path program 1 times [2024-10-11 19:13:11,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:11,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787357531] [2024-10-11 19:13:11,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:13:11,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:11,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:11,468 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:13:11,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 19:13:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:13:11,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:13:11,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:13:11,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:13:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:13:11,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:11,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787357531] [2024-10-11 19:13:11,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787357531] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:13:11,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:13:11,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 19:13:11,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837702170] [2024-10-11 19:13:11,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:13:11,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:13:11,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:11,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:13:11,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:13:11,741 INFO L87 Difference]: Start difference. First operand 1270 states and 1541 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:13:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:12,891 INFO L93 Difference]: Finished difference Result 1279 states and 1557 transitions. [2024-10-11 19:13:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:13:12,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 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 61 [2024-10-11 19:13:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:12,896 INFO L225 Difference]: With dead ends: 1279 [2024-10-11 19:13:12,899 INFO L226 Difference]: Without dead ends: 1279 [2024-10-11 19:13:12,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:13:12,900 INFO L432 NwaCegarLoop]: 934 mSDtfsCounter, 5 mSDsluCounter, 2792 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:12,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3726 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:13:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2024-10-11 19:13:12,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1278. [2024-10-11 19:13:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 786 states have (on average 1.950381679389313) internal successors, (1533), 1266 states have internal predecessors, (1533), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 19:13:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1554 transitions. [2024-10-11 19:13:12,919 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1554 transitions. Word has length 61 [2024-10-11 19:13:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:12,919 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1554 transitions. [2024-10-11 19:13:12,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:13:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1554 transitions. [2024-10-11 19:13:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 19:13:12,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:12,920 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] [2024-10-11 19:13:12,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-11 19:13:13,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:13,124 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:13:13,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:13,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1379701999, now seen corresponding path program 2 times [2024-10-11 19:13:13,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:13,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462591493] [2024-10-11 19:13:13,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:13:13,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:13,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:13,127 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:13:13,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 19:13:13,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:13:13,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:13:13,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:13:13,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:13:13,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:13:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:13:13,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:13,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462591493] [2024-10-11 19:13:13,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462591493] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:13:13,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:13:13,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 19:13:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779860383] [2024-10-11 19:13:13,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:13:13,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:13:13,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:13,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:13:13,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:13:13,645 INFO L87 Difference]: Start difference. First operand 1278 states and 1554 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:13:15,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:15,262 INFO L93 Difference]: Finished difference Result 1290 states and 1575 transitions. [2024-10-11 19:13:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:13:15,267 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 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 64 [2024-10-11 19:13:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:15,274 INFO L225 Difference]: With dead ends: 1290 [2024-10-11 19:13:15,274 INFO L226 Difference]: Without dead ends: 1288 [2024-10-11 19:13:15,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 19:13:15,275 INFO L432 NwaCegarLoop]: 934 mSDtfsCounter, 7 mSDsluCounter, 4660 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5594 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:15,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5594 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:13:15,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2024-10-11 19:13:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1287. [2024-10-11 19:13:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 795 states have (on average 1.9433962264150944) internal successors, (1545), 1275 states have internal predecessors, (1545), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 19:13:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1566 transitions. [2024-10-11 19:13:15,291 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1566 transitions. Word has length 64 [2024-10-11 19:13:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:15,292 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1566 transitions. [2024-10-11 19:13:15,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:13:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1566 transitions. [2024-10-11 19:13:15,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 19:13:15,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:15,292 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] [2024-10-11 19:13:15,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-11 19:13:15,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:15,493 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:13:15,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:15,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1898499535, now seen corresponding path program 3 times [2024-10-11 19:13:15,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:15,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377513405] [2024-10-11 19:13:15,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:13:15,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:15,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:15,495 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:13:15,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-11 19:13:16,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:13:16,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:13:16,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:13:16,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:13:16,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:13:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:13:16,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:16,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377513405] [2024-10-11 19:13:16,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377513405] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:13:16,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:13:16,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 19:13:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135943224] [2024-10-11 19:13:16,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:13:16,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:13:16,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:13:16,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:13:16,583 INFO L87 Difference]: Start difference. First operand 1287 states and 1566 transitions. Second operand has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:13:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:20,751 INFO L93 Difference]: Finished difference Result 1308 states and 1602 transitions. [2024-10-11 19:13:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 19:13:20,751 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 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 70 [2024-10-11 19:13:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:20,754 INFO L225 Difference]: With dead ends: 1308 [2024-10-11 19:13:20,754 INFO L226 Difference]: Without dead ends: 1305 [2024-10-11 19:13:20,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 19:13:20,755 INFO L432 NwaCegarLoop]: 934 mSDtfsCounter, 13 mSDsluCounter, 10248 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11182 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:20,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11182 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 19:13:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2024-10-11 19:13:20,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1305. [2024-10-11 19:13:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 813 states have (on average 1.928659286592866) internal successors, (1568), 1293 states have internal predecessors, (1568), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 19:13:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1589 transitions. [2024-10-11 19:13:20,767 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1589 transitions. Word has length 70 [2024-10-11 19:13:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:20,768 INFO L471 AbstractCegarLoop]: Abstraction has 1305 states and 1589 transitions. [2024-10-11 19:13:20,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:13:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1589 transitions. [2024-10-11 19:13:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 19:13:20,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:20,769 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] [2024-10-11 19:13:20,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-11 19:13:20,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:20,969 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:13:20,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:20,970 INFO L85 PathProgramCache]: Analyzing trace with hash -830683249, now seen corresponding path program 4 times [2024-10-11 19:13:20,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:20,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030267576] [2024-10-11 19:13:20,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:13:20,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:20,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:20,972 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:13:20,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-11 19:13:21,385 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:13:21,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:13:21,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 19:13:21,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:13:21,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:13:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:13:22,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:22,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030267576] [2024-10-11 19:13:22,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030267576] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:13:22,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:13:22,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 19:13:22,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10171362] [2024-10-11 19:13:22,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:13:22,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 19:13:22,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:22,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 19:13:22,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 19:13:22,842 INFO L87 Difference]: Start difference. First operand 1305 states and 1589 transitions. Second operand has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:13:32,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:32,610 INFO L93 Difference]: Finished difference Result 1342 states and 1660 transitions. [2024-10-11 19:13:32,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 19:13:32,612 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 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 82 [2024-10-11 19:13:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:32,614 INFO L225 Difference]: With dead ends: 1342 [2024-10-11 19:13:32,614 INFO L226 Difference]: Without dead ends: 1340 [2024-10-11 19:13:32,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 114 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-11 19:13:32,616 INFO L432 NwaCegarLoop]: 934 mSDtfsCounter, 25 mSDsluCounter, 26086 mSDsCounter, 0 mSdLazyCounter, 5646 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 27020 SdHoareTripleChecker+Invalid, 5683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 5646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:32,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 27020 Invalid, 5683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 5646 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-10-11 19:13:32,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2024-10-11 19:13:32,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1339. [2024-10-11 19:13:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 847 states have (on average 1.9055489964580874) internal successors, (1614), 1327 states have internal predecessors, (1614), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 19:13:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1635 transitions. [2024-10-11 19:13:32,634 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1635 transitions. Word has length 82 [2024-10-11 19:13:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:32,635 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 1635 transitions. [2024-10-11 19:13:32,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:13:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1635 transitions. [2024-10-11 19:13:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 19:13:32,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:32,636 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] [2024-10-11 19:13:32,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-11 19:13:32,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:32,840 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-10-11 19:13:32,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:32,840 INFO L85 PathProgramCache]: Analyzing trace with hash 960845167, now seen corresponding path program 5 times [2024-10-11 19:13:32,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:32,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469803004] [2024-10-11 19:13:32,841 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:13:32,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:13:32,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:32,843 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:13:32,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-11 19:13:34,071 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-11 19:13:34,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:13:34,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-11 19:13:34,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:34,133 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-11 19:13:34,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-10-11 19:13:34,489 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-10-11 19:13:34,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-10-11 19:13:34,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:13:34,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2024-10-11 19:13:36,650 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 19:13:36,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-10-11 19:13:36,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-10-11 19:13:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-11 19:13:36,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:13:37,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:37,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469803004] [2024-10-11 19:13:37,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469803004] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:13:37,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [630742795] [2024-10-11 19:13:37,089 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:13:37,089 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 19:13:37,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 19:13:37,091 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 19:13:37,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process