./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:02:38,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:02:38,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:02:38,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:02:38,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:02:38,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:02:38,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:02:38,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:02:38,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:02:38,260 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:02:38,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:02:38,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:02:38,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:02:38,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:02:38,261 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:02:38,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:02:38,262 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:02:38,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:02:38,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:02:38,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:02:38,266 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:02:38,267 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:02:38,267 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:02:38,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:02:38,268 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:02:38,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:02:38,268 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:02:38,269 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:02:38,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:02:38,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:02:38,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:02:38,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:02:38,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:02:38,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:02:38,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:02:38,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:02:38,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:02:38,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:02:38,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:02:38,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:02:38,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:02:38,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:02:38,273 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 [2024-11-19 09:02:38,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:02:38,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:02:38,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:02:38,567 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:02:38,567 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:02:38,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2024-11-19 09:02:39,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:02:40,244 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:02:40,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2024-11-19 09:02:40,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db8f0539/7f0c229eb4fa49169dffed998fb1103c/FLAG894b86209 [2024-11-19 09:02:40,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db8f0539/7f0c229eb4fa49169dffed998fb1103c [2024-11-19 09:02:40,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:02:40,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:02:40,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:02:40,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:02:40,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:02:40,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:02:40" (1/1) ... [2024-11-19 09:02:40,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d79eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:40, skipping insertion in model container [2024-11-19 09:02:40,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:02:40" (1/1) ... [2024-11-19 09:02:40,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:02:40,873 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:40,918 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:40,925 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:40,929 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:40,938 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:40,978 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:40,979 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:40,984 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:40,985 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:40,990 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:40,993 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:40,994 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:40,994 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:41,001 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:41,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:02:41,024 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-11-19 09:02:41,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4b0ec0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:41, skipping insertion in model container [2024-11-19 09:02:41,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:02:41,025 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:02:41,027 INFO L158 Benchmark]: Toolchain (without parser) took 733.59ms. Allocated memory is still 188.7MB. Free memory was 121.2MB in the beginning and 152.2MB in the end (delta: -30.9MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-19 09:02:41,027 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:02:41,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 730.98ms. Allocated memory is still 188.7MB. Free memory was 121.1MB in the beginning and 152.2MB in the end (delta: -31.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-19 09:02:41,029 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 730.98ms. Allocated memory is still 188.7MB. Free memory was 121.1MB in the beginning and 152.2MB in the end (delta: -31.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 727]: 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:02:43,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:02:43,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:02:43,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:02:43,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:02:43,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:02:43,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:02:43,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:02:43,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:02:43,168 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:02:43,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:02:43,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:02:43,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:02:43,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:02:43,171 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:02:43,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:02:43,172 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:02:43,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:02:43,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:02:43,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:02:43,175 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:02:43,175 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:02:43,176 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:02:43,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:02:43,176 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:02:43,176 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:02:43,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:02:43,177 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:02:43,177 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:02:43,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:02:43,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:02:43,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:02:43,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:02:43,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:02:43,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:02:43,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:02:43,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:02:43,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:02:43,183 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:02:43,184 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:02:43,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:02:43,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:02:43,185 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:02:43,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:02:43,186 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 [2024-11-19 09:02:43,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:02:43,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:02:43,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:02:43,553 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:02:43,553 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:02:43,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2024-11-19 09:02:45,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:02:45,572 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:02:45,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2024-11-19 09:02:45,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d647d6179/72a5665a6dd34189b4fe857952a538f7/FLAG853336149 [2024-11-19 09:02:45,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d647d6179/72a5665a6dd34189b4fe857952a538f7 [2024-11-19 09:02:45,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:02:45,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:02:45,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:02:45,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:02:45,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:02:45,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:02:45" (1/1) ... [2024-11-19 09:02:45,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d74387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:45, skipping insertion in model container [2024-11-19 09:02:45,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:02:45" (1/1) ... [2024-11-19 09:02:45,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:02:46,127 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,166 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,174 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,188 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,203 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,250 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,250 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,253 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,253 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,268 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,270 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,271 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,272 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,280 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:02:46,306 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:02:46,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:02:46,341 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,353 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,357 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,359 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,367 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,397 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,397 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,399 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,402 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,405 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,406 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,407 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,408 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,410 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:02:46,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:02:46,418 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:02:46,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:02:46,581 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:02:46,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:46 WrapperNode [2024-11-19 09:02:46,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:02:46,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:02:46,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:02:46,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:02:46,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:46" (1/1) ... [2024-11-19 09:02:46,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:46" (1/1) ... [2024-11-19 09:02:46,714 INFO L138 Inliner]: procedures = 179, calls = 272, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1037 [2024-11-19 09:02:46,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:02:46,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:02:46,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:02:46,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:02:46,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:46" (1/1) ... [2024-11-19 09:02:46,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:46" (1/1) ... [2024-11-19 09:02:46,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:46" (1/1) ... [2024-11-19 09:02:46,839 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 217, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-19 09:02:46,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:46" (1/1) ... [2024-11-19 09:02:46,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:46" (1/1) ... [2024-11-19 09:02:46,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:46" (1/1) ... [2024-11-19 09:02:46,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:46" (1/1) ... [2024-11-19 09:02:46,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:46" (1/1) ... [2024-11-19 09:02:46,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:46" (1/1) ... [2024-11-19 09:02:46,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:02:46,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:02:46,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:02:46,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:02:46,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:46" (1/1) ... [2024-11-19 09:02:46,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:02:46,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:02:46,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:02:46,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:02:47,024 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 09:02:47,025 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 09:02:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 09:02:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 09:02:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 09:02:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:02:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:02:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:02:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 09:02:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 09:02:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 09:02:47,026 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 09:02:47,027 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 09:02:47,027 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 09:02:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:02:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:02:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:02:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:02:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:02:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:02:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:02:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:02:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:02:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:02:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:02:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:02:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:02:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:02:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:02:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:02:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:02:47,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:02:47,279 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:02:47,283 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:02:47,313 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:02:47,365 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:02:47,386 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:02:51,134 INFO L? ?]: Removed 1074 outVars from TransFormulas that were not future-live. [2024-11-19 09:02:51,134 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:02:51,179 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:02:51,181 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 09:02:51,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:02:51 BoogieIcfgContainer [2024-11-19 09:02:51,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:02:51,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:02:51,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:02:51,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:02:51,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:02:45" (1/3) ... [2024-11-19 09:02:51,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a20a297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:02:51, skipping insertion in model container [2024-11-19 09:02:51,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:02:46" (2/3) ... [2024-11-19 09:02:51,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a20a297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:02:51, skipping insertion in model container [2024-11-19 09:02:51,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:02:51" (3/3) ... [2024-11-19 09:02:51,193 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test7-1.i [2024-11-19 09:02:51,208 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:02:51,209 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 523 error locations. [2024-11-19 09:02:51,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:02:51,296 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;@39898ae4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:02:51,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 523 error locations. [2024-11-19 09:02:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 1052 states, 524 states have (on average 2.2270992366412212) internal successors, (1167), 1045 states have internal predecessors, (1167), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 09:02:51,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:02:51,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:02:51,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:02:51,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:02:51,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:02:51,319 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-19 09:02:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:02:51,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550251936] [2024-11-19 09:02:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:02:51,332 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-11-19 09:02:51,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:02:51,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:02:51,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 09:02:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:02:51,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:02:51,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:02:51,524 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-11-19 09:02:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:02:51,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:02:51,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:02:51,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550251936] [2024-11-19 09:02:51,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550251936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:02:51,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:02:51,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:02:51,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109229626] [2024-11-19 09:02:51,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:02:51,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:02:51,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:02:51,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:02:51,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:02:51,600 INFO L87 Difference]: Start difference. First operand has 1052 states, 524 states have (on average 2.2270992366412212) internal successors, (1167), 1045 states have internal predecessors, (1167), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:02:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:02:52,913 INFO L93 Difference]: Finished difference Result 1043 states and 1099 transitions. [2024-11-19 09:02:52,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:02:52,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 09:02:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:02:52,936 INFO L225 Difference]: With dead ends: 1043 [2024-11-19 09:02:52,936 INFO L226 Difference]: Without dead ends: 1041 [2024-11-19 09:02:52,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:02:52,943 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 957 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:02:52,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 680 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:02:52,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-11-19 09:02:53,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1033. [2024-11-19 09:02:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 524 states have (on average 2.062977099236641) internal successors, (1081), 1027 states have internal predecessors, (1081), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:02:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1089 transitions. [2024-11-19 09:02:53,061 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1089 transitions. Word has length 3 [2024-11-19 09:02:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:02:53,062 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1089 transitions. [2024-11-19 09:02:53,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:02:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1089 transitions. [2024-11-19 09:02:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:02:53,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:02:53,063 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:02:53,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 09:02:53,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:02:53,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:02:53,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:02:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-19 09:02:53,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:02:53,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804572671] [2024-11-19 09:02:53,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:02:53,268 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-11-19 09:02:53,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:02:53,270 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:02:53,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 09:02:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:02:53,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:02:53,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:02:53,414 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-11-19 09:02:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:02:53,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:02:53,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:02:53,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804572671] [2024-11-19 09:02:53,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804572671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:02:53,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:02:53,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:02:53,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324152096] [2024-11-19 09:02:53,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:02:53,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:02:53,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:02:53,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:02:53,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:02:53,430 INFO L87 Difference]: Start difference. First operand 1033 states and 1089 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:02:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:02:55,205 INFO L93 Difference]: Finished difference Result 1430 states and 1518 transitions. [2024-11-19 09:02:55,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:02:55,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 09:02:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:02:55,211 INFO L225 Difference]: With dead ends: 1430 [2024-11-19 09:02:55,211 INFO L226 Difference]: Without dead ends: 1430 [2024-11-19 09:02:55,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:02:55,212 INFO L432 NwaCegarLoop]: 893 mSDtfsCounter, 426 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:02:55,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1460 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:02:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-11-19 09:02:55,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1242. [2024-11-19 09:02:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 734 states have (on average 2.0490463215258856) internal successors, (1504), 1236 states have internal predecessors, (1504), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:02:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1512 transitions. [2024-11-19 09:02:55,254 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1512 transitions. Word has length 3 [2024-11-19 09:02:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:02:55,254 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 1512 transitions. [2024-11-19 09:02:55,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:02:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1512 transitions. [2024-11-19 09:02:55,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 09:02:55,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:02:55,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:02:55,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 09:02:55,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:02:55,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:02:55,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:02:55,458 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-19 09:02:55,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:02:55,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023251141] [2024-11-19 09:02:55,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:02:55,459 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-11-19 09:02:55,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:02:55,462 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:02:55,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 09:02:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:02:55,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:02:55,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:02:55,607 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-11-19 09:02:55,615 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-11-19 09:02:55,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:02:55,704 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-11-19 09:02:55,724 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:02:55,724 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-11-19 09:02:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:02:55,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:02:55,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:02:55,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023251141] [2024-11-19 09:02:55,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023251141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:02:55,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:02:55,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:02:55,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750959462] [2024-11-19 09:02:55,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:02:55,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:02:55,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:02:55,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:02:55,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:02:55,752 INFO L87 Difference]: Start difference. First operand 1242 states and 1512 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:02:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:02:57,619 INFO L93 Difference]: Finished difference Result 1244 states and 1516 transitions. [2024-11-19 09:02:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:02:57,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 09:02:57,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:02:57,624 INFO L225 Difference]: With dead ends: 1244 [2024-11-19 09:02:57,624 INFO L226 Difference]: Without dead ends: 1244 [2024-11-19 09:02:57,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:02:57,625 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 1054 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:02:57,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 398 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 09:02:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-11-19 09:02:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1021. [2024-11-19 09:02:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 524 states have (on average 2.0381679389312977) internal successors, (1068), 1015 states have internal predecessors, (1068), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:02:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1076 transitions. [2024-11-19 09:02:57,646 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1076 transitions. Word has length 7 [2024-11-19 09:02:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:02:57,647 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1076 transitions. [2024-11-19 09:02:57,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:02:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1076 transitions. [2024-11-19 09:02:57,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:02:57,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:02:57,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:02:57,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:02:57,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:02:57,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:02:57,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:02:57,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-19 09:02:57,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:02:57,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043170180] [2024-11-19 09:02:57,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:02:57,851 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-11-19 09:02:57,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:02:57,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:02:57,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:02:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:02:57,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:02:57,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:02:57,988 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-11-19 09:02:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:02:58,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:02:58,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:02:58,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043170180] [2024-11-19 09:02:58,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043170180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:02:58,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:02:58,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:02:58,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890941893] [2024-11-19 09:02:58,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:02:58,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:02:58,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:02:58,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:02:58,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:02:58,017 INFO L87 Difference]: Start difference. First operand 1021 states and 1076 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:02:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:02:59,872 INFO L93 Difference]: Finished difference Result 1493 states and 1585 transitions. [2024-11-19 09:02:59,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:02:59,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 09:02:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:02:59,878 INFO L225 Difference]: With dead ends: 1493 [2024-11-19 09:02:59,878 INFO L226 Difference]: Without dead ends: 1493 [2024-11-19 09:02:59,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:02:59,879 INFO L432 NwaCegarLoop]: 1164 mSDtfsCounter, 692 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:02:59,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1582 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 09:02:59,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2024-11-19 09:02:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1048. [2024-11-19 09:02:59,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 561 states have (on average 2.0249554367201426) internal successors, (1136), 1042 states have internal predecessors, (1136), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:02:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1144 transitions. [2024-11-19 09:02:59,898 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1144 transitions. Word has length 8 [2024-11-19 09:02:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:02:59,899 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1144 transitions. [2024-11-19 09:02:59,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:02:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1144 transitions. [2024-11-19 09:02:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:02:59,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:02:59,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:02:59,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 09:03:00,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:00,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:00,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:00,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-19 09:03:00,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:00,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306603634] [2024-11-19 09:03:00,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:00,103 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-11-19 09:03:00,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:00,106 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:00,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 09:03:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:00,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:03:00,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:00,228 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-11-19 09:03:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:00,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:00,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:00,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306603634] [2024-11-19 09:03:00,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306603634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:00,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:00,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:03:00,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313428064] [2024-11-19 09:03:00,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:00,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:03:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:00,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:03:00,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:03:00,241 INFO L87 Difference]: Start difference. First operand 1048 states and 1144 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:01,516 INFO L93 Difference]: Finished difference Result 1383 states and 1505 transitions. [2024-11-19 09:03:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:03:01,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 09:03:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:01,521 INFO L225 Difference]: With dead ends: 1383 [2024-11-19 09:03:01,521 INFO L226 Difference]: Without dead ends: 1383 [2024-11-19 09:03:01,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:03:01,523 INFO L432 NwaCegarLoop]: 939 mSDtfsCounter, 925 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:01,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1183 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:03:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-19 09:03:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1001. [2024-11-19 09:03:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 561 states have (on average 1.9340463458110517) internal successors, (1085), 995 states have internal predecessors, (1085), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1093 transitions. [2024-11-19 09:03:01,544 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1093 transitions. Word has length 8 [2024-11-19 09:03:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:01,544 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1093 transitions. [2024-11-19 09:03:01,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1093 transitions. [2024-11-19 09:03:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 09:03:01,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:01,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:03:01,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 09:03:01,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:01,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr521ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:01,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:01,746 INFO L85 PathProgramCache]: Analyzing trace with hash -263475945, now seen corresponding path program 1 times [2024-11-19 09:03:01,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:01,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132022675] [2024-11-19 09:03:01,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:01,747 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-11-19 09:03:01,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:01,749 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:01,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 09:03:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:01,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:03:01,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:01,897 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:03:01,898 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:03:01,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-19 09:03:01,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:03:01,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2024-11-19 09:03:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:01,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:01,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:01,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132022675] [2024-11-19 09:03:01,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132022675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:01,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:01,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:03:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816901898] [2024-11-19 09:03:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:01,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:03:01,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:01,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:03:01,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:03:01,984 INFO L87 Difference]: Start difference. First operand 1001 states and 1093 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:02,427 INFO L93 Difference]: Finished difference Result 1984 states and 2171 transitions. [2024-11-19 09:03:02,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:03:02,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-19 09:03:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:02,432 INFO L225 Difference]: With dead ends: 1984 [2024-11-19 09:03:02,432 INFO L226 Difference]: Without dead ends: 1984 [2024-11-19 09:03:02,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:03:02,433 INFO L432 NwaCegarLoop]: 1188 mSDtfsCounter, 983 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 3339 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:02,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 3339 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 09:03:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2024-11-19 09:03:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1003. [2024-11-19 09:03:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 563 states have (on average 1.9307282415630551) internal successors, (1087), 997 states have internal predecessors, (1087), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1095 transitions. [2024-11-19 09:03:02,453 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1095 transitions. Word has length 12 [2024-11-19 09:03:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:02,454 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1095 transitions. [2024-11-19 09:03:02,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1095 transitions. [2024-11-19 09:03:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 09:03:02,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:02,455 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:03:02,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 09:03:02,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:02,656 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:02,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-19 09:03:02,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:02,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085995189] [2024-11-19 09:03:02,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:02,657 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-11-19 09:03:02,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:02,659 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:02,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 09:03:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:02,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:03:02,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:02,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:02,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:02,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085995189] [2024-11-19 09:03:02,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085995189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:02,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:02,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:03:02,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929614312] [2024-11-19 09:03:02,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:02,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:03:02,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:02,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:03:02,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:03:02,814 INFO L87 Difference]: Start difference. First operand 1003 states and 1095 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:02,838 INFO L93 Difference]: Finished difference Result 961 states and 1052 transitions. [2024-11-19 09:03:02,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:03:02,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 09:03:02,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:02,841 INFO L225 Difference]: With dead ends: 961 [2024-11-19 09:03:02,841 INFO L226 Difference]: Without dead ends: 961 [2024-11-19 09:03:02,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-11-19 09:03:02,842 INFO L432 NwaCegarLoop]: 956 mSDtfsCounter, 71 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:02,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1849 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:03:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2024-11-19 09:03:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2024-11-19 09:03:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 545 states have (on average 1.9155963302752295) internal successors, (1044), 955 states have internal predecessors, (1044), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1052 transitions. [2024-11-19 09:03:02,858 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1052 transitions. Word has length 18 [2024-11-19 09:03:02,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:02,858 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1052 transitions. [2024-11-19 09:03:02,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1052 transitions. [2024-11-19 09:03:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 09:03:02,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:02,859 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] [2024-11-19 09:03:02,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 09:03:03,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:03,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:03,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:03,060 INFO L85 PathProgramCache]: Analyzing trace with hash 582665080, now seen corresponding path program 1 times [2024-11-19 09:03:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:03,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498327301] [2024-11-19 09:03:03,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:03,061 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-11-19 09:03:03,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:03,062 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:03,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 09:03:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:03,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:03:03,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:03,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:03,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:03,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498327301] [2024-11-19 09:03:03,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498327301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:03,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:03,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:03:03,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057002578] [2024-11-19 09:03:03,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:03,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:03:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:03,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:03:03,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:03:03,207 INFO L87 Difference]: Start difference. First operand 961 states and 1052 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11-19 09:03:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:03,269 INFO L93 Difference]: Finished difference Result 939 states and 1023 transitions. [2024-11-19 09:03:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:03:03,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-19 09:03:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:03,272 INFO L225 Difference]: With dead ends: 939 [2024-11-19 09:03:03,272 INFO L226 Difference]: Without dead ends: 939 [2024-11-19 09:03:03,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-11-19 09:03:03,273 INFO L432 NwaCegarLoop]: 911 mSDtfsCounter, 48 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:03,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2707 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:03:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-11-19 09:03:03,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 939. [2024-11-19 09:03:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 537 states have (on average 1.8901303538175047) internal successors, (1015), 933 states have internal predecessors, (1015), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1023 transitions. [2024-11-19 09:03:03,288 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1023 transitions. Word has length 20 [2024-11-19 09:03:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:03,288 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1023 transitions. [2024-11-19 09:03:03,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11-19 09:03:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1023 transitions. [2024-11-19 09:03:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 09:03:03,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:03,290 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] [2024-11-19 09:03:03,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 09:03:03,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:03,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:03,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash -195006074, now seen corresponding path program 1 times [2024-11-19 09:03:03,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:03,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699847224] [2024-11-19 09:03:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:03,492 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-11-19 09:03:03,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:03,494 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:03,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 09:03:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:03,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:03:03,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:03,655 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-11-19 09:03:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:03,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:03,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:03,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699847224] [2024-11-19 09:03:03,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699847224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:03,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:03,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:03:03,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159081987] [2024-11-19 09:03:03,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:03,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:03:03,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:03,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:03:03,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:03:03,748 INFO L87 Difference]: Start difference. First operand 939 states and 1023 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-11-19 09:03:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:05,315 INFO L93 Difference]: Finished difference Result 1318 states and 1431 transitions. [2024-11-19 09:03:05,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:03:05,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-19 09:03:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:05,319 INFO L225 Difference]: With dead ends: 1318 [2024-11-19 09:03:05,319 INFO L226 Difference]: Without dead ends: 1318 [2024-11-19 09:03:05,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-11-19 09:03:05,319 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 858 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:05,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1171 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:03:05,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-11-19 09:03:05,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 935. [2024-11-19 09:03:05,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 537 states have (on average 1.8826815642458101) internal successors, (1011), 929 states have internal predecessors, (1011), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1019 transitions. [2024-11-19 09:03:05,336 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1019 transitions. Word has length 34 [2024-11-19 09:03:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:05,336 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1019 transitions. [2024-11-19 09:03:05,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-11-19 09:03:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1019 transitions. [2024-11-19 09:03:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 09:03:05,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:05,337 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] [2024-11-19 09:03:05,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 09:03:05,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:05,538 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:05,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash -195006073, now seen corresponding path program 1 times [2024-11-19 09:03:05,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:05,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648604509] [2024-11-19 09:03:05,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:05,539 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-11-19 09:03:05,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:05,542 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:05,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 09:03:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:05,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:03:05,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:05,700 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-11-19 09:03:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:05,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:05,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:05,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648604509] [2024-11-19 09:03:05,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648604509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:05,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:05,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:03:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991780099] [2024-11-19 09:03:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:05,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:03:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:05,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:03:05,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:03:05,860 INFO L87 Difference]: Start difference. First operand 935 states and 1019 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-11-19 09:03:07,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:07,889 INFO L93 Difference]: Finished difference Result 1380 states and 1460 transitions. [2024-11-19 09:03:07,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:03:07,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-19 09:03:07,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:07,893 INFO L225 Difference]: With dead ends: 1380 [2024-11-19 09:03:07,893 INFO L226 Difference]: Without dead ends: 1380 [2024-11-19 09:03:07,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-11-19 09:03:07,894 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 621 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:07,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 1529 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 09:03:07,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-11-19 09:03:07,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 931. [2024-11-19 09:03:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 537 states have (on average 1.8752327746741155) internal successors, (1007), 925 states have internal predecessors, (1007), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1015 transitions. [2024-11-19 09:03:07,908 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1015 transitions. Word has length 34 [2024-11-19 09:03:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:07,908 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1015 transitions. [2024-11-19 09:03:07,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-11-19 09:03:07,909 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1015 transitions. [2024-11-19 09:03:07,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 09:03:07,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:07,910 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-11-19 09:03:07,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 09:03:08,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:08,111 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:08,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 512632320, now seen corresponding path program 1 times [2024-11-19 09:03:08,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:08,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073349668] [2024-11-19 09:03:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:08,113 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-11-19 09:03:08,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:08,116 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:08,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 09:03:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:08,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:03:08,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:08,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:08,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:08,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073349668] [2024-11-19 09:03:08,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073349668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:08,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:08,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:03:08,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853530054] [2024-11-19 09:03:08,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:08,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:03:08,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:08,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:03:08,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:03:08,346 INFO L87 Difference]: Start difference. First operand 931 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 12.5) 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-11-19 09:03:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:08,400 INFO L93 Difference]: Finished difference Result 925 states and 1005 transitions. [2024-11-19 09:03:08,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:03:08,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) 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-11-19 09:03:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:08,403 INFO L225 Difference]: With dead ends: 925 [2024-11-19 09:03:08,403 INFO L226 Difference]: Without dead ends: 925 [2024-11-19 09:03:08,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-11-19 09:03:08,404 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 21 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:08,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2684 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:03:08,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-19 09:03:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925. [2024-11-19 09:03:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 531 states have (on average 1.8775894538606404) internal successors, (997), 919 states have internal predecessors, (997), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1005 transitions. [2024-11-19 09:03:08,416 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1005 transitions. Word has length 50 [2024-11-19 09:03:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:08,416 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1005 transitions. [2024-11-19 09:03:08,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) 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-11-19 09:03:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1005 transitions. [2024-11-19 09:03:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 09:03:08,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:08,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:03:08,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 09:03:08,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:08,618 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:08,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:08,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1557557452, now seen corresponding path program 1 times [2024-11-19 09:03:08,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:08,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447912115] [2024-11-19 09:03:08,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:08,620 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-11-19 09:03:08,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:08,621 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:08,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 09:03:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:08,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:03:08,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:09,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:09,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:09,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447912115] [2024-11-19 09:03:09,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447912115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:09,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:09,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:03:09,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075831998] [2024-11-19 09:03:09,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:09,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:03:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:09,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:03:09,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:03:09,097 INFO L87 Difference]: Start difference. First operand 925 states and 1005 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:09,308 INFO L93 Difference]: Finished difference Result 1269 states and 1391 transitions. [2024-11-19 09:03:09,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:03:09,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-19 09:03:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:09,312 INFO L225 Difference]: With dead ends: 1269 [2024-11-19 09:03:09,312 INFO L226 Difference]: Without dead ends: 1269 [2024-11-19 09:03:09,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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-11-19 09:03:09,314 INFO L432 NwaCegarLoop]: 1126 mSDtfsCounter, 309 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:09,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1968 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:03:09,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2024-11-19 09:03:09,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1134. [2024-11-19 09:03:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 740 states have (on average 1.8405405405405406) internal successors, (1362), 1128 states have internal predecessors, (1362), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1370 transitions. [2024-11-19 09:03:09,329 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1370 transitions. Word has length 58 [2024-11-19 09:03:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:09,330 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1370 transitions. [2024-11-19 09:03:09,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1370 transitions. [2024-11-19 09:03:09,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 09:03:09,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:09,333 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-11-19 09:03:09,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-19 09:03:09,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:09,539 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:09,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1740051530, now seen corresponding path program 1 times [2024-11-19 09:03:09,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:09,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543055268] [2024-11-19 09:03:09,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:09,540 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-11-19 09:03:09,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:09,541 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:09,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 09:03:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:09,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:03:09,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:09,796 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-11-19 09:03:09,801 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-11-19 09:03:10,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:03:10,262 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-11-19 09:03:10,276 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:03:10,276 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-11-19 09:03:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:10,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:10,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:10,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543055268] [2024-11-19 09:03:10,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543055268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:10,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:10,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:03:10,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031934028] [2024-11-19 09:03:10,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:10,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:03:10,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:10,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:03:10,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:03:10,287 INFO L87 Difference]: Start difference. First operand 1134 states and 1370 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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-11-19 09:03:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:11,982 INFO L93 Difference]: Finished difference Result 1552 states and 1913 transitions. [2024-11-19 09:03:11,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:03:11,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-11-19 09:03:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:11,986 INFO L225 Difference]: With dead ends: 1552 [2024-11-19 09:03:11,986 INFO L226 Difference]: Without dead ends: 1552 [2024-11-19 09:03:11,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 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-11-19 09:03:11,987 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1205 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:11,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 475 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:03:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2024-11-19 09:03:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1059. [2024-11-19 09:03:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 703 states have (on average 1.7780938833570412) internal successors, (1250), 1053 states have internal predecessors, (1250), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1258 transitions. [2024-11-19 09:03:12,002 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1258 transitions. Word has length 61 [2024-11-19 09:03:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:12,002 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1258 transitions. [2024-11-19 09:03:12,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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-11-19 09:03:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1258 transitions. [2024-11-19 09:03:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 09:03:12,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:12,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:03:12,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 09:03:12,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:12,204 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:12,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454369, now seen corresponding path program 1 times [2024-11-19 09:03:12,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:12,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363197567] [2024-11-19 09:03:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:12,205 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-11-19 09:03:12,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:12,206 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:12,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 09:03:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:12,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:03:12,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:12,418 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-11-19 09:03:12,432 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-11-19 09:03:12,451 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-11-19 09:03:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:12,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:12,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:12,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363197567] [2024-11-19 09:03:12,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363197567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:12,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:12,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:03:12,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390979946] [2024-11-19 09:03:12,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:12,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:03:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:12,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:03:12,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:03:12,460 INFO L87 Difference]: Start difference. First operand 1059 states and 1258 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-11-19 09:03:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:13,813 INFO L93 Difference]: Finished difference Result 1058 states and 1257 transitions. [2024-11-19 09:03:13,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:03:13,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-19 09:03:13,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:13,815 INFO L225 Difference]: With dead ends: 1058 [2024-11-19 09:03:13,816 INFO L226 Difference]: Without dead ends: 1058 [2024-11-19 09:03:13,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 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-11-19 09:03:13,816 INFO L432 NwaCegarLoop]: 878 mSDtfsCounter, 2 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:13,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2256 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 09:03:13,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-11-19 09:03:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2024-11-19 09:03:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 703 states have (on average 1.7766714082503556) internal successors, (1249), 1052 states have internal predecessors, (1249), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1257 transitions. [2024-11-19 09:03:13,828 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1257 transitions. Word has length 66 [2024-11-19 09:03:13,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:13,828 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1257 transitions. [2024-11-19 09:03:13,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-11-19 09:03:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1257 transitions. [2024-11-19 09:03:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 09:03:13,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:13,830 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:03:13,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 09:03:14,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:14,031 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:14,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:14,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454368, now seen corresponding path program 1 times [2024-11-19 09:03:14,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:14,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782264376] [2024-11-19 09:03:14,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:14,032 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-11-19 09:03:14,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:14,035 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:14,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 09:03:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:14,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:03:14,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:14,269 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-11-19 09:03:14,288 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-11-19 09:03:14,299 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-11-19 09:03:14,324 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-11-19 09:03:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:14,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:14,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:14,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782264376] [2024-11-19 09:03:14,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782264376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:14,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:14,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:03:14,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240466615] [2024-11-19 09:03:14,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:14,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:03:14,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:14,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:03:14,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:03:14,343 INFO L87 Difference]: Start difference. First operand 1058 states and 1257 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-11-19 09:03:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:15,968 INFO L93 Difference]: Finished difference Result 1057 states and 1256 transitions. [2024-11-19 09:03:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:03:15,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-19 09:03:15,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:15,971 INFO L225 Difference]: With dead ends: 1057 [2024-11-19 09:03:15,971 INFO L226 Difference]: Without dead ends: 1057 [2024-11-19 09:03:15,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 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-11-19 09:03:15,972 INFO L432 NwaCegarLoop]: 878 mSDtfsCounter, 1 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:15,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2294 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 09:03:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-11-19 09:03:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1057. [2024-11-19 09:03:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 702 states have (on average 1.7777777777777777) internal successors, (1248), 1051 states have internal predecessors, (1248), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1256 transitions. [2024-11-19 09:03:15,983 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1256 transitions. Word has length 66 [2024-11-19 09:03:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:15,983 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1256 transitions. [2024-11-19 09:03:15,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-11-19 09:03:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1256 transitions. [2024-11-19 09:03:15,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 09:03:15,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:15,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:03:15,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 09:03:16,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:16,185 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:16,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:16,186 INFO L85 PathProgramCache]: Analyzing trace with hash -439730522, now seen corresponding path program 1 times [2024-11-19 09:03:16,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:16,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73568316] [2024-11-19 09:03:16,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:16,186 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-11-19 09:03:16,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:16,188 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:16,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 09:03:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:16,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:03:16,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:16,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:16,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:16,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73568316] [2024-11-19 09:03:16,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73568316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:16,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:16,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:03:16,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424625959] [2024-11-19 09:03:16,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:16,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:03:16,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:16,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:03:16,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:03:16,462 INFO L87 Difference]: Start difference. First operand 1057 states and 1256 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-11-19 09:03:16,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:16,499 INFO L93 Difference]: Finished difference Result 1060 states and 1260 transitions. [2024-11-19 09:03:16,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:03:16,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 74 [2024-11-19 09:03:16,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:16,506 INFO L225 Difference]: With dead ends: 1060 [2024-11-19 09:03:16,508 INFO L226 Difference]: Without dead ends: 1060 [2024-11-19 09:03:16,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 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-11-19 09:03:16,509 INFO L432 NwaCegarLoop]: 878 mSDtfsCounter, 0 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2629 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:16,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2629 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:03:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-19 09:03:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2024-11-19 09:03:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 704 states have (on average 1.7769886363636365) internal successors, (1251), 1054 states have internal predecessors, (1251), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:03:16,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1260 transitions. [2024-11-19 09:03:16,530 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1260 transitions. Word has length 74 [2024-11-19 09:03:16,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:16,530 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1260 transitions. [2024-11-19 09:03:16,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-11-19 09:03:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1260 transitions. [2024-11-19 09:03:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 09:03:16,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:16,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:03:16,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-19 09:03:16,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:16,732 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:16,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:16,732 INFO L85 PathProgramCache]: Analyzing trace with hash 258431926, now seen corresponding path program 1 times [2024-11-19 09:03:16,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:16,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970698941] [2024-11-19 09:03:16,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:16,733 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-11-19 09:03:16,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:16,736 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:16,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 09:03:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:16,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:03:16,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:17,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:03:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:17,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:17,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970698941] [2024-11-19 09:03:17,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970698941] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:03:17,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:03:17,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 09:03:17,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201651430] [2024-11-19 09:03:17,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:03:17,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:03:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:17,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:03:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:03:17,057 INFO L87 Difference]: Start difference. First operand 1060 states and 1260 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-11-19 09:03:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:17,179 INFO L93 Difference]: Finished difference Result 1072 states and 1277 transitions. [2024-11-19 09:03:17,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:03:17,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-19 09:03:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:17,183 INFO L225 Difference]: With dead ends: 1072 [2024-11-19 09:03:17,183 INFO L226 Difference]: Without dead ends: 1072 [2024-11-19 09:03:17,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 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-11-19 09:03:17,183 INFO L432 NwaCegarLoop]: 878 mSDtfsCounter, 7 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2631 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:17,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2631 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:03:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-19 09:03:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1070. [2024-11-19 09:03:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 713 states have (on average 1.7755960729312763) internal successors, (1266), 1063 states have internal predecessors, (1266), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:03:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1275 transitions. [2024-11-19 09:03:17,199 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1275 transitions. Word has length 75 [2024-11-19 09:03:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:17,200 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1275 transitions. [2024-11-19 09:03:17,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-11-19 09:03:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1275 transitions. [2024-11-19 09:03:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 09:03:17,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:17,203 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:03:17,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-19 09:03:17,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:17,404 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:17,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash -223280474, now seen corresponding path program 2 times [2024-11-19 09:03:17,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:17,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345923391] [2024-11-19 09:03:17,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:03:17,405 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-11-19 09:03:17,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:17,406 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:17,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-19 09:03:17,772 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:03:17,772 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:03:17,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:03:17,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:17,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:03:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:17,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:17,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345923391] [2024-11-19 09:03:17,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345923391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:03:17,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:03:17,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 09:03:17,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631906908] [2024-11-19 09:03:17,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:03:17,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:03:17,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:17,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:03:17,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:03:17,953 INFO L87 Difference]: Start difference. First operand 1070 states and 1275 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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-11-19 09:03:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:18,370 INFO L93 Difference]: Finished difference Result 1085 states and 1297 transitions. [2024-11-19 09:03:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 09:03:18,371 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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 78 [2024-11-19 09:03:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:18,374 INFO L225 Difference]: With dead ends: 1085 [2024-11-19 09:03:18,374 INFO L226 Difference]: Without dead ends: 1081 [2024-11-19 09:03:18,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-19 09:03:18,375 INFO L432 NwaCegarLoop]: 878 mSDtfsCounter, 14 mSDsluCounter, 4379 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5257 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:18,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5257 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:03:18,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2024-11-19 09:03:18,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1079. [2024-11-19 09:03:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 722 states have (on average 1.7700831024930748) internal successors, (1278), 1072 states have internal predecessors, (1278), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:03:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1287 transitions. [2024-11-19 09:03:18,390 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1287 transitions. Word has length 78 [2024-11-19 09:03:18,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:18,390 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1287 transitions. [2024-11-19 09:03:18,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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-11-19 09:03:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1287 transitions. [2024-11-19 09:03:18,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 09:03:18,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:18,392 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:03:18,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-19 09:03:18,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:18,596 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:18,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:18,596 INFO L85 PathProgramCache]: Analyzing trace with hash 360147110, now seen corresponding path program 3 times [2024-11-19 09:03:18,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:18,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206842318] [2024-11-19 09:03:18,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:03:18,597 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-11-19 09:03:18,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:18,599 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:18,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-19 09:03:19,164 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 09:03:19,164 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:03:19,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:03:19,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:19,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:03:19,703 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:19,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:19,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206842318] [2024-11-19 09:03:19,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206842318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:03:19,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:03:19,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 09:03:19,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398846529] [2024-11-19 09:03:19,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:03:19,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 09:03:19,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:19,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 09:03:19,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 09:03:19,706 INFO L87 Difference]: Start difference. First operand 1079 states and 1287 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 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-11-19 09:03:21,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:21,074 INFO L93 Difference]: Finished difference Result 1103 states and 1326 transitions. [2024-11-19 09:03:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 09:03:21,074 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 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 84 [2024-11-19 09:03:21,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:21,078 INFO L225 Difference]: With dead ends: 1103 [2024-11-19 09:03:21,078 INFO L226 Difference]: Without dead ends: 1097 [2024-11-19 09:03:21,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 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-11-19 09:03:21,079 INFO L432 NwaCegarLoop]: 879 mSDtfsCounter, 25 mSDsluCounter, 9638 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 10517 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:21,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 10517 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 09:03:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-19 09:03:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2024-11-19 09:03:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 740 states have (on average 1.758108108108108) internal successors, (1301), 1090 states have internal predecessors, (1301), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:03:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1310 transitions. [2024-11-19 09:03:21,091 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1310 transitions. Word has length 84 [2024-11-19 09:03:21,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:21,091 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1310 transitions. [2024-11-19 09:03:21,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 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-11-19 09:03:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1310 transitions. [2024-11-19 09:03:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 09:03:21,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:21,093 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:03:21,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-19 09:03:21,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:21,293 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:21,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:21,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1514752858, now seen corresponding path program 4 times [2024-11-19 09:03:21,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:21,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176027096] [2024-11-19 09:03:21,294 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:03:21,294 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-11-19 09:03:21,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:21,296 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:21,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-19 09:03:21,750 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:03:21,750 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:03:21,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 09:03:21,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:22,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:03:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:23,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:23,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176027096] [2024-11-19 09:03:23,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176027096] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:03:23,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:03:23,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 09:03:23,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727200930] [2024-11-19 09:03:23,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:03:23,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 09:03:23,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:23,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 09:03:23,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 09:03:23,500 INFO L87 Difference]: Start difference. First operand 1097 states and 1310 transitions. Second operand has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 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-11-19 09:03:27,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:27,930 INFO L93 Difference]: Finished difference Result 1137 states and 1382 transitions. [2024-11-19 09:03:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 09:03:27,931 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 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 96 [2024-11-19 09:03:27,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:27,935 INFO L225 Difference]: With dead ends: 1137 [2024-11-19 09:03:27,935 INFO L226 Difference]: Without dead ends: 1133 [2024-11-19 09:03:27,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 09:03:27,937 INFO L432 NwaCegarLoop]: 879 mSDtfsCounter, 49 mSDsluCounter, 21001 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 21880 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:27,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 21880 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:03:27,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2024-11-19 09:03:27,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1131. [2024-11-19 09:03:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 774 states have (on average 1.7403100775193798) internal successors, (1347), 1124 states have internal predecessors, (1347), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:03:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1356 transitions. [2024-11-19 09:03:27,950 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1356 transitions. Word has length 96 [2024-11-19 09:03:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:27,951 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1356 transitions. [2024-11-19 09:03:27,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 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-11-19 09:03:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1356 transitions. [2024-11-19 09:03:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 09:03:27,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:27,952 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:03:27,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-19 09:03:28,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:28,157 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 520 more)] === [2024-11-19 09:03:28,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:28,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1229367974, now seen corresponding path program 5 times [2024-11-19 09:03:28,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:28,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365759683] [2024-11-19 09:03:28,158 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:03:28,158 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-11-19 09:03:28,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:28,159 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:28,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-19 09:03:29,207 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-19 09:03:29,207 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:03:29,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-19 09:03:29,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:29,236 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-11-19 09:03:29,319 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 09:03:29,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 09:03:29,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:03:29,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-19 09:03:30,181 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:03:30,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-19 09:03:30,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-19 09:03:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 09:03:30,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:03:30,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:30,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365759683] [2024-11-19 09:03:30,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365759683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:03:30,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [467780447] [2024-11-19 09:03:30,599 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:03:30,599 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 09:03:30,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 09:03:30,601 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 09:03:30,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process