./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_test1-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_test1-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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:12:14,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:12:14,119 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:14,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:12:14,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:12:14,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:12:14,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:12:14,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:12:14,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:12:14,153 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:12:14,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:12:14,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:12:14,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:12:14,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:12:14,156 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:12:14,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:12:14,156 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:12:14,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:12:14,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:12:14,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:12:14,157 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:12:14,161 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:12:14,161 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:12:14,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:12:14,161 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:12:14,161 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:12:14,162 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:12:14,162 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:12:14,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:12:14,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:12:14,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:12:14,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:12:14,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:12:14,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:12:14,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:12:14,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:12:14,163 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:12:14,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:12:14,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:12:14,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:12:14,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:12:14,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:12:14,166 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-10-11 19:12:14,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:12:14,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:12:14,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:12:14,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:12:14,434 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:12:14,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2024-10-11 19:12:15,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:12:16,074 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:12:16,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2024-10-11 19:12:16,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d81a473f6/ce275a63649545f6a1e0dca08f6a51a6/FLAG472543a03 [2024-10-11 19:12:16,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d81a473f6/ce275a63649545f6a1e0dca08f6a51a6 [2024-10-11 19:12:16,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:12:16,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:12:16,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:12:16,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:12:16,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:12:16,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:12:16" (1/1) ... [2024-10-11 19:12:16,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e790270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:16, skipping insertion in model container [2024-10-11 19:12:16,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:12:16" (1/1) ... [2024-10-11 19:12:16,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:12:16,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:12:16,647 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:16,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5dd22f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:16, skipping insertion in model container [2024-10-11 19:12:16,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:12:16,648 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:12:16,650 INFO L158 Benchmark]: Toolchain (without parser) took 532.32ms. Allocated memory is still 186.6MB. Free memory was 113.7MB in the beginning and 94.6MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 19:12:16,650 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 186.6MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:12:16,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.36ms. Allocated memory is still 186.6MB. Free memory was 113.5MB in the beginning and 94.6MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 19:12:16,655 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.17ms. Allocated memory is still 186.6MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.36ms. Allocated memory is still 186.6MB. Free memory was 113.5MB in the beginning and 94.6MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 738]: 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_test1-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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:12:18,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:12:18,718 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:18,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:12:18,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:12:18,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:12:18,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:12:18,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:12:18,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:12:18,749 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:12:18,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:12:18,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:12:18,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:12:18,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:12:18,752 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:12:18,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:12:18,753 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:12:18,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:12:18,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:12:18,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:12:18,756 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:12:18,756 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:12:18,756 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:12:18,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:12:18,757 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:12:18,757 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:12:18,757 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:12:18,757 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:12:18,757 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:12:18,757 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:12:18,758 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:12:18,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:12:18,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:12:18,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:12:18,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:12:18,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:12:18,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:12:18,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:12:18,759 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:12:18,759 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:12:18,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:12:18,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:12:18,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:12:18,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:12:18,761 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:12:18,762 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-10-11 19:12:19,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:12:19,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:12:19,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:12:19,092 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:12:19,092 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:12:19,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2024-10-11 19:12:20,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:12:20,961 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:12:20,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2024-10-11 19:12:20,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/33304f41a/e1475d44a2b44f45be1a2bc06b920ea9/FLAGb5a17b32a [2024-10-11 19:12:21,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/33304f41a/e1475d44a2b44f45be1a2bc06b920ea9 [2024-10-11 19:12:21,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:12:21,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:12:21,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:12:21,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:12:21,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:12:21,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:12:21" (1/1) ... [2024-10-11 19:12:21,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45832dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:21, skipping insertion in model container [2024-10-11 19:12:21,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:12:21" (1/1) ... [2024-10-11 19:12:21,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:12:22,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:12:22,050 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:12:22,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:12:22,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:12:22,142 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:12:22,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:12:22,262 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:12:22,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:22 WrapperNode [2024-10-11 19:12:22,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:12:22,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:12:22,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:12:22,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:12:22,270 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:22" (1/1) ... [2024-10-11 19:12:22,310 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:22" (1/1) ... [2024-10-11 19:12:22,377 INFO L138 Inliner]: procedures = 179, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 762 [2024-10-11 19:12:22,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:12:22,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:12:22,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:12:22,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:12:22,394 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:22" (1/1) ... [2024-10-11 19:12:22,398 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:22" (1/1) ... [2024-10-11 19:12:22,403 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:22" (1/1) ... [2024-10-11 19:12:22,447 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-10-11 19:12:22,448 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:22" (1/1) ... [2024-10-11 19:12:22,448 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:22" (1/1) ... [2024-10-11 19:12:22,487 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:22" (1/1) ... [2024-10-11 19:12:22,497 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:22" (1/1) ... [2024-10-11 19:12:22,503 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:22" (1/1) ... [2024-10-11 19:12:22,511 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:22" (1/1) ... [2024-10-11 19:12:22,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:12:22,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:12:22,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:12:22,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:12:22,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:22" (1/1) ... [2024-10-11 19:12:22,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:12:22,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:12:22,563 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:22,572 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:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:12:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:12:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:12:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:12:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:12:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:12:22,614 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:12:22,614 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:12:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:12:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:12:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:12:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:12:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:12:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:12:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:12:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:12:22,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:12:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:12:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:12:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:12:22,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:12:22,803 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:12:22,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:12:22,808 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:12:22,846 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:12:25,163 INFO L? ?]: Removed 894 outVars from TransFormulas that were not future-live. [2024-10-11 19:12:25,163 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:12:25,296 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:12:25,297 INFO L314 CfgBuilder]: Removed 40 assume(true) statements. [2024-10-11 19:12:25,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:12:25 BoogieIcfgContainer [2024-10-11 19:12:25,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:12:25,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:12:25,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:12:25,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:12:25,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:12:21" (1/3) ... [2024-10-11 19:12:25,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2dc9a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:12:25, skipping insertion in model container [2024-10-11 19:12:25,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:22" (2/3) ... [2024-10-11 19:12:25,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2dc9a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:12:25, skipping insertion in model container [2024-10-11 19:12:25,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:12:25" (3/3) ... [2024-10-11 19:12:25,307 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test1-2.i [2024-10-11 19:12:25,323 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:12:25,323 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 425 error locations. [2024-10-11 19:12:25,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:12:25,376 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;@671ab70c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:12:25,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations. [2024-10-11 19:12:25,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 753 states, 326 states have (on average 2.549079754601227) internal successors, (831), 748 states have internal predecessors, (831), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:12:25,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 19:12:25,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:25,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 19:12:25,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:25,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:25,391 INFO L85 PathProgramCache]: Analyzing trace with hash 38547730, now seen corresponding path program 1 times [2024-10-11 19:12:25,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:25,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445167026] [2024-10-11 19:12:25,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:25,401 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:25,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:25,404 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:25,428 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:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:25,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:12:25,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:25,549 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:25,564 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:25,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:25,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:25,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445167026] [2024-10-11 19:12:25,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445167026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:25,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:25,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:12:25,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403950812] [2024-10-11 19:12:25,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:25,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:25,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:25,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:25,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:25,592 INFO L87 Difference]: Start difference. First operand has 753 states, 326 states have (on average 2.549079754601227) internal successors, (831), 748 states have internal predecessors, (831), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:26,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:26,737 INFO L93 Difference]: Finished difference Result 696 states and 735 transitions. [2024-10-11 19:12:26,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:26,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 19:12:26,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:26,749 INFO L225 Difference]: With dead ends: 696 [2024-10-11 19:12:26,750 INFO L226 Difference]: Without dead ends: 695 [2024-10-11 19:12:26,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:26,753 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 455 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:26,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 496 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:12:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-10-11 19:12:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2024-10-11 19:12:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 321 states have (on average 2.2585669781931466) internal successors, (725), 688 states have internal predecessors, (725), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:12:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 731 transitions. [2024-10-11 19:12:26,818 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 731 transitions. Word has length 4 [2024-10-11 19:12:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:26,819 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 731 transitions. [2024-10-11 19:12:26,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 731 transitions. [2024-10-11 19:12:26,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 19:12:26,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:26,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 19:12:26,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 19:12:27,022 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:27,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:27,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:27,023 INFO L85 PathProgramCache]: Analyzing trace with hash 38547731, now seen corresponding path program 1 times [2024-10-11 19:12:27,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:27,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378205357] [2024-10-11 19:12:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:27,024 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:27,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:27,027 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:27,030 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:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:27,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:12:27,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:27,114 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:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:12:27,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:27,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:27,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378205357] [2024-10-11 19:12:27,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378205357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:27,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:27,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:12:27,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000036601] [2024-10-11 19:12:27,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:27,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:27,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:27,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:27,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:27,139 INFO L87 Difference]: Start difference. First operand 693 states and 731 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:28,382 INFO L93 Difference]: Finished difference Result 756 states and 798 transitions. [2024-10-11 19:12:28,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:28,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 19:12:28,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:28,390 INFO L225 Difference]: With dead ends: 756 [2024-10-11 19:12:28,390 INFO L226 Difference]: Without dead ends: 756 [2024-10-11 19:12:28,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:28,391 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 235 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:28,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 774 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:12:28,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-11 19:12:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 709. [2024-10-11 19:12:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 348 states have (on average 2.235632183908046) internal successors, (778), 704 states have internal predecessors, (778), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:12:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 784 transitions. [2024-10-11 19:12:28,408 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 784 transitions. Word has length 4 [2024-10-11 19:12:28,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:28,409 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 784 transitions. [2024-10-11 19:12:28,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 784 transitions. [2024-10-11 19:12:28,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 19:12:28,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:28,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 19:12:28,415 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 (3)] Forceful destruction successful, exit code 0 [2024-10-11 19:12:28,610 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:28,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:28,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:28,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1195792100, now seen corresponding path program 1 times [2024-10-11 19:12:28,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:28,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038587863] [2024-10-11 19:12:28,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:28,612 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:28,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:28,616 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:28,617 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:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:28,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:12:28,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:28,690 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:28,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:28,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:28,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038587863] [2024-10-11 19:12:28,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038587863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:28,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:28,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:12:28,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619015559] [2024-10-11 19:12:28,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:28,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:28,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:28,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:28,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:28,691 INFO L87 Difference]: Start difference. First operand 709 states and 784 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:29,269 INFO L93 Difference]: Finished difference Result 1216 states and 1354 transitions. [2024-10-11 19:12:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:29,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 19:12:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:29,274 INFO L225 Difference]: With dead ends: 1216 [2024-10-11 19:12:29,274 INFO L226 Difference]: Without dead ends: 1216 [2024-10-11 19:12:29,275 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:29,275 INFO L432 NwaCegarLoop]: 810 mSDtfsCounter, 499 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:29,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 1444 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:12:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-10-11 19:12:29,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 710. [2024-10-11 19:12:29,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 349 states have (on average 2.232091690544413) internal successors, (779), 705 states have internal predecessors, (779), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:12:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 785 transitions. [2024-10-11 19:12:29,290 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 785 transitions. Word has length 5 [2024-10-11 19:12:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:29,290 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 785 transitions. [2024-10-11 19:12:29,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 785 transitions. [2024-10-11 19:12:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 19:12:29,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:29,291 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:29,295 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 (4)] Forceful destruction successful, exit code 0 [2024-10-11 19:12:29,494 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:29,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:29,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:29,498 INFO L85 PathProgramCache]: Analyzing trace with hash -31267943, now seen corresponding path program 1 times [2024-10-11 19:12:29,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:29,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924322012] [2024-10-11 19:12:29,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:29,499 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:29,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:29,501 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:29,506 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:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:29,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:12:29,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:29,601 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:29,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:29,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:29,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924322012] [2024-10-11 19:12:29,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924322012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:29,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:29,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:12:29,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556590402] [2024-10-11 19:12:29,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:29,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:29,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:29,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:29,607 INFO L87 Difference]: Start difference. First operand 710 states and 785 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:30,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:30,019 INFO L93 Difference]: Finished difference Result 671 states and 745 transitions. [2024-10-11 19:12:30,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:30,021 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:30,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:30,023 INFO L225 Difference]: With dead ends: 671 [2024-10-11 19:12:30,024 INFO L226 Difference]: Without dead ends: 671 [2024-10-11 19:12:30,024 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:30,028 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 61 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:30,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1134 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 19:12:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-10-11 19:12:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2024-10-11 19:12:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 334 states have (on average 2.212574850299401) internal successors, (739), 666 states have internal predecessors, (739), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:12:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 745 transitions. [2024-10-11 19:12:30,065 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 745 transitions. Word has length 11 [2024-10-11 19:12:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:30,065 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 745 transitions. [2024-10-11 19:12:30,065 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:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 745 transitions. [2024-10-11 19:12:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 19:12:30,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:30,066 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:30,070 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 (5)] Forceful destruction successful, exit code 0 [2024-10-11 19:12:30,266 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:30,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:30,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:30,268 INFO L85 PathProgramCache]: Analyzing trace with hash 16274164, now seen corresponding path program 1 times [2024-10-11 19:12:30,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:30,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655408630] [2024-10-11 19:12:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:30,271 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:30,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:30,273 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:30,274 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:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:30,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:12:30,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:30,372 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:30,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:30,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:30,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655408630] [2024-10-11 19:12:30,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655408630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:30,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:30,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:12:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959018676] [2024-10-11 19:12:30,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:30,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:30,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:30,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:30,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:30,375 INFO L87 Difference]: Start difference. First operand 671 states and 745 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:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:30,963 INFO L93 Difference]: Finished difference Result 656 states and 723 transitions. [2024-10-11 19:12:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:12:30,965 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:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:30,967 INFO L225 Difference]: With dead ends: 656 [2024-10-11 19:12:30,967 INFO L226 Difference]: Without dead ends: 656 [2024-10-11 19:12:30,968 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:30,968 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 45 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:30,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1653 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:12:30,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-11 19:12:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2024-10-11 19:12:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 333 states have (on average 2.1531531531531534) internal successors, (717), 651 states have internal predecessors, (717), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:12:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 723 transitions. [2024-10-11 19:12:30,978 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 723 transitions. Word has length 13 [2024-10-11 19:12:30,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:30,978 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 723 transitions. [2024-10-11 19:12:30,978 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:30,979 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 723 transitions. [2024-10-11 19:12:30,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 19:12:30,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:30,979 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:30,984 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:31,180 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:31,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:31,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:31,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1697104799, now seen corresponding path program 1 times [2024-10-11 19:12:31,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:31,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904379361] [2024-10-11 19:12:31,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:31,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:31,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:31,188 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:31,190 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:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:31,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:12:31,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:31,293 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:31,361 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:31,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:31,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:31,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904379361] [2024-10-11 19:12:31,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904379361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:31,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:31,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:12:31,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670796102] [2024-10-11 19:12:31,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:31,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:31,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:31,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:31,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:31,366 INFO L87 Difference]: Start difference. First operand 656 states and 723 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:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:32,506 INFO L93 Difference]: Finished difference Result 656 states and 723 transitions. [2024-10-11 19:12:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:12:32,507 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:32,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:32,512 INFO L225 Difference]: With dead ends: 656 [2024-10-11 19:12:32,512 INFO L226 Difference]: Without dead ends: 656 [2024-10-11 19:12:32,512 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:32,513 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 398 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:32,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 702 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:12:32,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-11 19:12:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 652. [2024-10-11 19:12:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 333 states have (on average 2.141141141141141) internal successors, (713), 647 states have internal predecessors, (713), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:12:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 719 transitions. [2024-10-11 19:12:32,531 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 719 transitions. Word has length 27 [2024-10-11 19:12:32,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:32,533 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 719 transitions. [2024-10-11 19:12:32,533 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:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 719 transitions. [2024-10-11 19:12:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 19:12:32,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:32,541 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:32,550 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:32,741 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:32,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:32,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:32,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1697104798, now seen corresponding path program 1 times [2024-10-11 19:12:32,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:32,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751404299] [2024-10-11 19:12:32,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:32,745 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:32,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:32,748 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:32,752 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:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:32,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:12:32,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:32,883 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:33,026 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:33,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:33,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:33,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751404299] [2024-10-11 19:12:33,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751404299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:33,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:33,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:12:33,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311431614] [2024-10-11 19:12:33,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:33,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:33,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:33,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:33,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:33,027 INFO L87 Difference]: Start difference. First operand 652 states and 719 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:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:34,607 INFO L93 Difference]: Finished difference Result 699 states and 733 transitions. [2024-10-11 19:12:34,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:12:34,609 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:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:34,611 INFO L225 Difference]: With dead ends: 699 [2024-10-11 19:12:34,611 INFO L226 Difference]: Without dead ends: 699 [2024-10-11 19:12:34,612 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:34,613 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 174 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:34,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 996 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:12:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-10-11 19:12:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 648. [2024-10-11 19:12:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 333 states have (on average 2.129129129129129) internal successors, (709), 643 states have internal predecessors, (709), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:12:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 715 transitions. [2024-10-11 19:12:34,626 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 715 transitions. Word has length 27 [2024-10-11 19:12:34,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:34,627 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 715 transitions. [2024-10-11 19:12:34,628 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:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 715 transitions. [2024-10-11 19:12:34,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 19:12:34,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:34,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:34,635 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:34,830 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:34,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:34,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:34,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2141839909, now seen corresponding path program 1 times [2024-10-11 19:12:34,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:34,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594622499] [2024-10-11 19:12:34,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:34,833 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:34,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:34,835 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:34,836 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:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:34,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:12:34,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:35,018 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:35,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:35,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:35,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594622499] [2024-10-11 19:12:35,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594622499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:35,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:35,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:12:35,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367728030] [2024-10-11 19:12:35,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:35,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:35,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:35,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:35,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:35,021 INFO L87 Difference]: Start difference. First operand 648 states and 715 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:35,474 INFO L93 Difference]: Finished difference Result 642 states and 705 transitions. [2024-10-11 19:12:35,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:12:35,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-11 19:12:35,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:35,476 INFO L225 Difference]: With dead ends: 642 [2024-10-11 19:12:35,476 INFO L226 Difference]: Without dead ends: 642 [2024-10-11 19:12:35,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:12:35,477 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 15 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:35,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1636 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 19:12:35,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-11 19:12:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2024-10-11 19:12:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 327 states have (on average 2.1376146788990824) internal successors, (699), 637 states have internal predecessors, (699), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:12:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 705 transitions. [2024-10-11 19:12:35,484 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 705 transitions. Word has length 43 [2024-10-11 19:12:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:35,485 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 705 transitions. [2024-10-11 19:12:35,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 705 transitions. [2024-10-11 19:12:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 19:12:35,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:35,486 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:35,491 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 (9)] Forceful destruction successful, exit code 0 [2024-10-11 19:12:35,689 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:35,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:35,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1994884924, now seen corresponding path program 1 times [2024-10-11 19:12:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:35,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588293663] [2024-10-11 19:12:35,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:35,691 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:35,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:35,694 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:35,696 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:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:35,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:12:35,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:36,007 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:36,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:36,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:36,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588293663] [2024-10-11 19:12:36,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588293663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:36,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:36,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:12:36,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370422082] [2024-10-11 19:12:36,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:36,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:36,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:36,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:36,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:36,008 INFO L87 Difference]: Start difference. First operand 642 states and 705 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:36,504 INFO L93 Difference]: Finished difference Result 840 states and 932 transitions. [2024-10-11 19:12:36,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:36,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-11 19:12:36,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:36,508 INFO L225 Difference]: With dead ends: 840 [2024-10-11 19:12:36,508 INFO L226 Difference]: Without dead ends: 840 [2024-10-11 19:12:36,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:36,512 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 161 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:36,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1121 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:12:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-10-11 19:12:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 686. [2024-10-11 19:12:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 371 states have (on average 2.0026954177897576) internal successors, (743), 681 states have internal predecessors, (743), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:12:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 749 transitions. [2024-10-11 19:12:36,532 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 749 transitions. Word has length 47 [2024-10-11 19:12:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:36,532 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 749 transitions. [2024-10-11 19:12:36,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:12:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 749 transitions. [2024-10-11 19:12:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 19:12:36,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:36,534 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:12:36,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 19:12:36,734 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:36,734 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:36,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:36,735 INFO L85 PathProgramCache]: Analyzing trace with hash 46829257, now seen corresponding path program 1 times [2024-10-11 19:12:36,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:36,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598064326] [2024-10-11 19:12:36,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:36,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:36,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:36,738 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:36,739 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:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:36,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:12:36,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:36,944 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:36,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:12:37,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:12:37,257 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:12:37,272 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:12:37,272 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:12:37,284 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:37,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:37,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:37,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598064326] [2024-10-11 19:12:37,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598064326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:37,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:37,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:12:37,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402218968] [2024-10-11 19:12:37,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:37,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:37,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:37,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:37,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:37,286 INFO L87 Difference]: Start difference. First operand 686 states and 749 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:12:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:38,241 INFO L93 Difference]: Finished difference Result 648 states and 711 transitions. [2024-10-11 19:12:38,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:12:38,242 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:12:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:38,244 INFO L225 Difference]: With dead ends: 648 [2024-10-11 19:12:38,244 INFO L226 Difference]: Without dead ends: 648 [2024-10-11 19:12:38,244 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:12:38,245 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 662 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:38,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 375 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 19:12:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-10-11 19:12:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 621. [2024-10-11 19:12:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 344 states have (on average 1.8633720930232558) internal successors, (641), 616 states have internal predecessors, (641), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:12:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 647 transitions. [2024-10-11 19:12:38,251 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 647 transitions. Word has length 50 [2024-10-11 19:12:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:38,251 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 647 transitions. [2024-10-11 19:12:38,251 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:12:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 647 transitions. [2024-10-11 19:12:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 19:12:38,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:38,252 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:12:38,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 19:12:38,456 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:12:38,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:38,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:38,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1600429972, now seen corresponding path program 1 times [2024-10-11 19:12:38,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:38,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289127177] [2024-10-11 19:12:38,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:38,458 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:38,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:38,460 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:12:38,475 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:12:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:38,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:12:38,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:38,693 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:38,711 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:12:38,733 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:12:38,741 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:38,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:38,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:38,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289127177] [2024-10-11 19:12:38,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289127177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:38,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:38,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:12:38,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809712544] [2024-10-11 19:12:38,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:38,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:12:38,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:38,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:12:38,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:12:38,746 INFO L87 Difference]: Start difference. First operand 621 states and 647 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:12:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:39,921 INFO L93 Difference]: Finished difference Result 620 states and 646 transitions. [2024-10-11 19:12:39,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:12:39,922 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:12:39,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:39,925 INFO L225 Difference]: With dead ends: 620 [2024-10-11 19:12:39,925 INFO L226 Difference]: Without dead ends: 620 [2024-10-11 19:12:39,926 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:12:39,926 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 2 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:39,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1325 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:12:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-10-11 19:12:39,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2024-10-11 19:12:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 344 states have (on average 1.8604651162790697) internal successors, (640), 615 states have internal predecessors, (640), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:12:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 646 transitions. [2024-10-11 19:12:39,937 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 646 transitions. Word has length 54 [2024-10-11 19:12:39,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:39,938 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 646 transitions. [2024-10-11 19:12:39,938 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:12:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 646 transitions. [2024-10-11 19:12:39,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 19:12:39,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:39,940 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:12:39,947 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 (12)] Forceful destruction successful, exit code 0 [2024-10-11 19:12:40,141 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:12:40,141 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:40,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:40,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1600429971, now seen corresponding path program 1 times [2024-10-11 19:12:40,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:40,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319202424] [2024-10-11 19:12:40,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:40,142 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:40,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:40,144 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:12:40,145 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:12:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:40,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:12:40,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:40,330 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:40,354 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:12:40,385 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:12:40,432 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:12:40,453 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,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:40,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:40,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319202424] [2024-10-11 19:12:40,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319202424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:40,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:40,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:12:40,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328588264] [2024-10-11 19:12:40,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:40,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:12:40,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:40,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:12:40,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:12:40,455 INFO L87 Difference]: Start difference. First operand 620 states and 646 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:12:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:42,231 INFO L93 Difference]: Finished difference Result 619 states and 645 transitions. [2024-10-11 19:12:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:12:42,232 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:12:42,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:42,234 INFO L225 Difference]: With dead ends: 619 [2024-10-11 19:12:42,234 INFO L226 Difference]: Without dead ends: 619 [2024-10-11 19:12:42,234 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:12:42,234 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 1 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:42,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1348 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:12:42,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-10-11 19:12:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2024-10-11 19:12:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 343 states have (on average 1.8629737609329446) internal successors, (639), 614 states have internal predecessors, (639), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:12:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 645 transitions. [2024-10-11 19:12:42,241 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 645 transitions. Word has length 54 [2024-10-11 19:12:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:42,241 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 645 transitions. [2024-10-11 19:12:42,241 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:12:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 645 transitions. [2024-10-11 19:12:42,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 19:12:42,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:42,242 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:12:42,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 19:12:42,446 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:12:42,447 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:42,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:42,447 INFO L85 PathProgramCache]: Analyzing trace with hash 284761873, now seen corresponding path program 1 times [2024-10-11 19:12:42,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:42,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16119358] [2024-10-11 19:12:42,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:42,448 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,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:42,450 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:12:42,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 19:12:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:42,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:12:42,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:42,622 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,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:42,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:42,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16119358] [2024-10-11 19:12:42,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16119358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:42,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:42,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:12:42,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359138207] [2024-10-11 19:12:42,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:42,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:42,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:42,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:42,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:42,624 INFO L87 Difference]: Start difference. First operand 619 states and 645 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:12:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:43,090 INFO L93 Difference]: Finished difference Result 621 states and 648 transitions. [2024-10-11 19:12:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:12:43,091 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:12:43,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:43,094 INFO L225 Difference]: With dead ends: 621 [2024-10-11 19:12:43,094 INFO L226 Difference]: Without dead ends: 621 [2024-10-11 19:12:43,095 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:12:43,096 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 0 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:43,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1572 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:12:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-10-11 19:12:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2024-10-11 19:12:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 344 states have (on average 1.8633720930232558) internal successors, (641), 616 states have internal predecessors, (641), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:12:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 648 transitions. [2024-10-11 19:12:43,105 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 648 transitions. Word has length 60 [2024-10-11 19:12:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:43,105 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 648 transitions. [2024-10-11 19:12:43,106 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:12:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 648 transitions. [2024-10-11 19:12:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 19:12:43,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:43,107 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:12:43,119 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:12:43,310 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:12:43,311 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:43,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1242313806, now seen corresponding path program 1 times [2024-10-11 19:12:43,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:43,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12291024] [2024-10-11 19:12:43,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:43,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:12:43,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:43,314 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:12:43,315 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:12:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:43,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:12:43,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:43,516 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:12:43,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:12:43,563 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:12:43,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:43,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12291024] [2024-10-11 19:12:43,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12291024] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:12:43,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:12:43,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 19:12:43,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318389324] [2024-10-11 19:12:43,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:12:43,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:12:43,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:43,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:12:43,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:12:43,565 INFO L87 Difference]: Start difference. First operand 621 states and 648 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:12:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:44,190 INFO L93 Difference]: Finished difference Result 630 states and 662 transitions. [2024-10-11 19:12:44,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:12:44,192 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:12:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:44,193 INFO L225 Difference]: With dead ends: 630 [2024-10-11 19:12:44,193 INFO L226 Difference]: Without dead ends: 630 [2024-10-11 19:12:44,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:12:44,194 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 5 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:44,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2092 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:12:44,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-10-11 19:12:44,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 629. [2024-10-11 19:12:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 351 states have (on average 1.8632478632478633) internal successors, (654), 623 states have internal predecessors, (654), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:12:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 661 transitions. [2024-10-11 19:12:44,201 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 661 transitions. Word has length 61 [2024-10-11 19:12:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:44,201 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 661 transitions. [2024-10-11 19:12:44,201 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:12:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 661 transitions. [2024-10-11 19:12:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 19:12:44,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:44,202 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:12:44,210 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:12:44,402 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:12:44,402 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:44,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash -795885743, now seen corresponding path program 2 times [2024-10-11 19:12:44,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:44,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942977791] [2024-10-11 19:12:44,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:12:44,403 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,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:44,406 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:12:44,406 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:12:44,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:12:44,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:12:44,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:12:44,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:44,730 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:12:44,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:12:44,879 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:12:44,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:44,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942977791] [2024-10-11 19:12:44,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942977791] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:12:44,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:12:44,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 19:12:44,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615972771] [2024-10-11 19:12:44,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:12:44,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:12:44,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:44,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:12:44,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:12:44,885 INFO L87 Difference]: Start difference. First operand 629 states and 661 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:12:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:46,019 INFO L93 Difference]: Finished difference Result 641 states and 680 transitions. [2024-10-11 19:12:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:12:46,021 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:12:46,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:46,024 INFO L225 Difference]: With dead ends: 641 [2024-10-11 19:12:46,024 INFO L226 Difference]: Without dead ends: 639 [2024-10-11 19:12:46,026 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:12:46,026 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 8 mSDsluCounter, 2615 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:46,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3139 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 19:12:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-10-11 19:12:46,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 638. [2024-10-11 19:12:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 360 states have (on average 1.85) internal successors, (666), 632 states have internal predecessors, (666), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:12:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 673 transitions. [2024-10-11 19:12:46,035 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 673 transitions. Word has length 64 [2024-10-11 19:12:46,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:46,035 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 673 transitions. [2024-10-11 19:12:46,036 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:12:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 673 transitions. [2024-10-11 19:12:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 19:12:46,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:46,037 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:12:46,046 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:12:46,241 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:12:46,242 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:46,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:46,242 INFO L85 PathProgramCache]: Analyzing trace with hash 980136881, now seen corresponding path program 3 times [2024-10-11 19:12:46,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:46,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883858202] [2024-10-11 19:12:46,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:12:46,243 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:46,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:46,244 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:12:46,248 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:12:46,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:12:46,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:12:46,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:12:46,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:46,927 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:12:46,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:12:47,393 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:12:47,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:47,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883858202] [2024-10-11 19:12:47,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883858202] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:12:47,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:12:47,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 19:12:47,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250659497] [2024-10-11 19:12:47,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:12:47,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:12:47,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:47,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:12:47,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:12:47,396 INFO L87 Difference]: Start difference. First operand 638 states and 673 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:12:50,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:50,296 INFO L93 Difference]: Finished difference Result 659 states and 709 transitions. [2024-10-11 19:12:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 19:12:50,297 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:12:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:50,298 INFO L225 Difference]: With dead ends: 659 [2024-10-11 19:12:50,298 INFO L226 Difference]: Without dead ends: 656 [2024-10-11 19:12:50,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 19:12:50,299 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 14 mSDsluCounter, 5751 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6275 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:50,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6275 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 19:12:50,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-11 19:12:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2024-10-11 19:12:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 378 states have (on average 1.8227513227513228) internal successors, (689), 650 states have internal predecessors, (689), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:12:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 696 transitions. [2024-10-11 19:12:50,320 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 696 transitions. Word has length 70 [2024-10-11 19:12:50,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:50,320 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 696 transitions. [2024-10-11 19:12:50,320 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:12:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 696 transitions. [2024-10-11 19:12:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 19:12:50,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:50,321 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:12:50,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 19:12:50,525 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:12:50,526 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:50,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:50,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1484307343, now seen corresponding path program 4 times [2024-10-11 19:12:50,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:50,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696312726] [2024-10-11 19:12:50,526 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:12:50,527 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,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:50,528 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:12:50,532 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:12:50,869 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:12:50,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:12:50,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 19:12:50,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:51,215 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:12:51,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:12:52,409 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:12:52,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:52,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696312726] [2024-10-11 19:12:52,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696312726] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:12:52,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:12:52,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 19:12:52,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661556736] [2024-10-11 19:12:52,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:12:52,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 19:12:52,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:52,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 19:12:52,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 19:12:52,412 INFO L87 Difference]: Start difference. First operand 656 states and 696 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:12:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:59,173 INFO L93 Difference]: Finished difference Result 693 states and 765 transitions. [2024-10-11 19:12:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 19:12:59,175 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:12:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:59,179 INFO L225 Difference]: With dead ends: 693 [2024-10-11 19:12:59,179 INFO L226 Difference]: Without dead ends: 691 [2024-10-11 19:12:59,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 19:12:59,183 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 26 mSDsluCounter, 12029 mSDsCounter, 0 mSdLazyCounter, 3610 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12553 SdHoareTripleChecker+Invalid, 3672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:59,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 12553 Invalid, 3672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 3610 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 19:12:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-11 19:12:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 690. [2024-10-11 19:12:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 412 states have (on average 1.7839805825242718) internal successors, (735), 684 states have internal predecessors, (735), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:12:59,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 742 transitions. [2024-10-11 19:12:59,196 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 742 transitions. Word has length 82 [2024-10-11 19:12:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:59,197 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 742 transitions. [2024-10-11 19:12:59,197 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:12:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 742 transitions. [2024-10-11 19:12:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 19:12:59,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:59,198 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:12:59,209 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:12:59,402 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:12:59,403 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:12:59,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:59,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1118494255, now seen corresponding path program 5 times [2024-10-11 19:12:59,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:59,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743792535] [2024-10-11 19:12:59,404 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:12:59,404 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:59,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:59,409 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:12:59,427 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:00,378 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-11 19:13:00,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:13:00,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-10-11 19:13:00,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:00,410 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:00,570 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:13:00,570 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:00,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-11 19:13:00,600 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 11 treesize of output 7 [2024-10-11 19:13:00,607 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 15 treesize of output 1 [2024-10-11 19:13:00,672 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 18 treesize of output 10 [2024-10-11 19:13:00,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-11 19:13:01,192 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 19:13:01,193 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 50 treesize of output 45 [2024-10-11 19:13:01,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 11 [2024-10-11 19:13:01,224 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 25 treesize of output 13 [2024-10-11 19:13:01,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-11 19:13:01,244 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:01,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:13:02,110 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1738 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_1739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1738 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-10-11 19:13:02,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:02,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743792535] [2024-10-11 19:13:02,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743792535] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:13:02,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1299872231] [2024-10-11 19:13:02,114 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:13:02,114 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 19:13:02,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 19:13:02,117 INFO L229 MonitoredProcess]: Starting monitored process 20 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:02,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process