./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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_BER_nondet_test4-2.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 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:42:50,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:42:50,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 02:42:50,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:42:50,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:42:50,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:42:50,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:42:50,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:42:50,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:42:50,555 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:42:50,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:42:50,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:42:50,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:42:50,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:42:50,557 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:42:50,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:42:50,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:42:50,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:42:50,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:42:50,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:42:50,558 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:42:50,560 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:42:50,560 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:42:50,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:42:50,561 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:42:50,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:42:50,561 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:42:50,561 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:42:50,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:42:50,562 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:42:50,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:42:50,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:42:50,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:42:50,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:42:50,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:42:50,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:42:50,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 02:42:50,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 02:42:50,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:42:50,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:42:50,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:42:50,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:42:50,565 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 -> 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 [2024-11-17 02:42:50,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:42:50,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:42:50,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:42:50,801 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:42:50,801 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:42:50,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-2.i [2024-11-17 02:42:52,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:42:52,473 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:42:52,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-2.i [2024-11-17 02:42:52,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a68bc31fe/f6caf3bd71754f7b9127ed22178449f1/FLAGc431c8b61 [2024-11-17 02:42:52,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a68bc31fe/f6caf3bd71754f7b9127ed22178449f1 [2024-11-17 02:42:52,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:42:52,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:42:52,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:42:52,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:42:52,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:42:52,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:42:52" (1/1) ... [2024-11-17 02:42:52,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5ced58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:52, skipping insertion in model container [2024-11-17 02:42:52,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:42:52" (1/1) ... [2024-11-17 02:42:52,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:42:53,212 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,254 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,259 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,265 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,274 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,303 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,304 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,306 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,310 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,322 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,327 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,328 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,329 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,333 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,334 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,337 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:53,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:42:53,366 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-17 02:42:53,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@60b21eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:53, skipping insertion in model container [2024-11-17 02:42:53,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:42:53,368 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 02:42:53,369 INFO L158 Benchmark]: Toolchain (without parser) took 566.21ms. Allocated memory was 142.6MB in the beginning and 245.4MB in the end (delta: 102.8MB). Free memory was 70.3MB in the beginning and 205.7MB in the end (delta: -135.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-11-17 02:42:53,369 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 142.6MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 02:42:53,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.62ms. Allocated memory was 142.6MB in the beginning and 245.4MB in the end (delta: 102.8MB). Free memory was 70.1MB in the beginning and 205.7MB in the end (delta: -135.6MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-11-17 02:42:53,371 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.10ms. Allocated memory is still 142.6MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.62ms. Allocated memory was 142.6MB in the beginning and 245.4MB in the end (delta: 102.8MB). Free memory was 70.1MB in the beginning and 205.7MB in the end (delta: -135.6MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 754]: 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_BER_nondet_test4-2.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 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:42:55,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:42:55,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 02:42:55,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:42:55,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:42:55,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:42:55,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:42:55,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:42:55,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:42:55,693 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:42:55,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:42:55,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:42:55,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:42:55,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:42:55,696 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:42:55,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:42:55,698 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:42:55,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:42:55,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:42:55,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:42:55,699 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:42:55,699 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:42:55,699 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:42:55,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:42:55,702 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:42:55,702 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 02:42:55,702 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:42:55,702 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 02:42:55,702 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:42:55,703 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:42:55,703 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:42:55,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:42:55,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:42:55,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:42:55,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:42:55,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:42:55,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:42:55,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:42:55,704 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 02:42:55,704 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 02:42:55,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:42:55,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:42:55,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:42:55,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:42:55,707 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 -> 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 [2024-11-17 02:42:55,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:42:56,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:42:56,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:42:56,014 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:42:56,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:42:56,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-2.i [2024-11-17 02:42:57,456 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:42:57,711 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:42:57,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-2.i [2024-11-17 02:42:57,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a42d6e5/49888a494c1d4584af5d90cd34b212b7/FLAGd2cfd7b14 [2024-11-17 02:42:58,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a42d6e5/49888a494c1d4584af5d90cd34b212b7 [2024-11-17 02:42:58,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:42:58,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:42:58,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:42:58,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:42:58,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:42:58,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:42:58" (1/1) ... [2024-11-17 02:42:58,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b235745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58, skipping insertion in model container [2024-11-17 02:42:58,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:42:58" (1/1) ... [2024-11-17 02:42:58,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:42:58,465 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,502 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,507 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,510 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,515 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,542 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,544 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,546 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,549 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,555 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,556 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,557 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,558 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,559 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,559 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,562 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:42:58,585 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 02:42:58,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:42:58,624 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,644 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,649 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,650 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,655 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,677 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,678 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,679 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,682 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,687 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,687 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,688 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,692 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,692 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,693 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,694 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:42:58,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:42:58,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 02:42:58,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:42:58,821 INFO L204 MainTranslator]: Completed translation [2024-11-17 02:42:58,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58 WrapperNode [2024-11-17 02:42:58,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:42:58,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 02:42:58,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 02:42:58,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 02:42:58,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58" (1/1) ... [2024-11-17 02:42:58,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58" (1/1) ... [2024-11-17 02:42:58,930 INFO L138 Inliner]: procedures = 179, calls = 377, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1272 [2024-11-17 02:42:58,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 02:42:58,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 02:42:58,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 02:42:58,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 02:42:58,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58" (1/1) ... [2024-11-17 02:42:58,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58" (1/1) ... [2024-11-17 02:42:58,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58" (1/1) ... [2024-11-17 02:42:59,037 INFO L175 MemorySlicer]: Split 357 memory accesses to 2 slices as follows [2, 355]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 90 writes are split as follows [0, 90]. [2024-11-17 02:42:59,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58" (1/1) ... [2024-11-17 02:42:59,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58" (1/1) ... [2024-11-17 02:42:59,081 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58" (1/1) ... [2024-11-17 02:42:59,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58" (1/1) ... [2024-11-17 02:42:59,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58" (1/1) ... [2024-11-17 02:42:59,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58" (1/1) ... [2024-11-17 02:42:59,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 02:42:59,103 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 02:42:59,104 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 02:42:59,104 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 02:42:59,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58" (1/1) ... [2024-11-17 02:42:59,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:42:59,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:42:59,134 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-17 02:42:59,139 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-17 02:42:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 02:42:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 02:42:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 02:42:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 02:42:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 02:42:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 02:42:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 02:42:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 02:42:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 02:42:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 02:42:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 02:42:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 02:42:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 02:42:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 02:42:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 02:42:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 02:42:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 02:42:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 02:42:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 02:42:59,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 02:42:59,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 02:42:59,375 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 02:42:59,377 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 02:43:02,707 INFO L? ?]: Removed 1537 outVars from TransFormulas that were not future-live. [2024-11-17 02:43:02,707 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 02:43:02,747 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 02:43:02,747 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 02:43:02,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:43:02 BoogieIcfgContainer [2024-11-17 02:43:02,748 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 02:43:02,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 02:43:02,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 02:43:02,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 02:43:02,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:42:58" (1/3) ... [2024-11-17 02:43:02,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37edf6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:43:02, skipping insertion in model container [2024-11-17 02:43:02,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:42:58" (2/3) ... [2024-11-17 02:43:02,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37edf6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:43:02, skipping insertion in model container [2024-11-17 02:43:02,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:43:02" (3/3) ... [2024-11-17 02:43:02,757 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test4-2.i [2024-11-17 02:43:02,779 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 02:43:02,780 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 733 error locations. [2024-11-17 02:43:02,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 02:43:02,836 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;@152b3ef8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 02:43:02,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 733 error locations. [2024-11-17 02:43:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 1461 states, 726 states have (on average 2.1942148760330578) internal successors, (1593), 1453 states have internal predecessors, (1593), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:43:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 02:43:02,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:02,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 02:43:02,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:02,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:02,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1563066915, now seen corresponding path program 1 times [2024-11-17 02:43:02,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:02,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134763608] [2024-11-17 02:43:02,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:02,879 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-17 02:43:02,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:02,882 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-17 02:43:02,920 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-17 02:43:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:03,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 02:43:03,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:03,063 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-17 02:43:03,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:03,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:03,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134763608] [2024-11-17 02:43:03,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134763608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:03,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:03,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:43:03,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808041305] [2024-11-17 02:43:03,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:03,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:43:03,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:03,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:43:03,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:43:03,095 INFO L87 Difference]: Start difference. First operand has 1461 states, 726 states have (on average 2.1942148760330578) internal successors, (1593), 1453 states have internal predecessors, (1593), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:43:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:04,846 INFO L93 Difference]: Finished difference Result 1658 states and 1737 transitions. [2024-11-17 02:43:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:43:04,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-17 02:43:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:04,863 INFO L225 Difference]: With dead ends: 1658 [2024-11-17 02:43:04,864 INFO L226 Difference]: Without dead ends: 1652 [2024-11-17 02:43:04,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:43:04,867 INFO L432 NwaCegarLoop]: 1408 mSDtfsCounter, 228 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:04,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 2184 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 02:43:04,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2024-11-17 02:43:04,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1459. [2024-11-17 02:43:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 735 states have (on average 2.074829931972789) internal successors, (1525), 1451 states have internal predecessors, (1525), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:43:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1537 transitions. [2024-11-17 02:43:04,954 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1537 transitions. Word has length 5 [2024-11-17 02:43:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:04,955 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 1537 transitions. [2024-11-17 02:43:04,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:43:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1537 transitions. [2024-11-17 02:43:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 02:43:04,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:04,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:43:04,961 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-17 02:43:05,156 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-17 02:43:05,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr731REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:05,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:05,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1080546782, now seen corresponding path program 1 times [2024-11-17 02:43:05,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:05,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364549891] [2024-11-17 02:43:05,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:05,159 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-17 02:43:05,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:05,161 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-17 02:43:05,162 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-17 02:43:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:05,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:43:05,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:05,273 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-17 02:43:05,280 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-17 02:43:05,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:05,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:05,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364549891] [2024-11-17 02:43:05,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364549891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:05,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:05,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:43:05,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844539661] [2024-11-17 02:43:05,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:05,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:43:05,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:05,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:43:05,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:43:05,283 INFO L87 Difference]: Start difference. First operand 1459 states and 1537 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:43:06,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:06,681 INFO L93 Difference]: Finished difference Result 1365 states and 1441 transitions. [2024-11-17 02:43:06,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:43:06,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-17 02:43:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:06,685 INFO L225 Difference]: With dead ends: 1365 [2024-11-17 02:43:06,685 INFO L226 Difference]: Without dead ends: 1365 [2024-11-17 02:43:06,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:43:06,686 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 1048 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:06,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 913 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:43:06,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2024-11-17 02:43:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1365. [2024-11-17 02:43:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 735 states have (on average 1.94421768707483) internal successors, (1429), 1357 states have internal predecessors, (1429), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:43:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1441 transitions. [2024-11-17 02:43:06,703 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1441 transitions. Word has length 7 [2024-11-17 02:43:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:06,703 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 1441 transitions. [2024-11-17 02:43:06,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:43:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1441 transitions. [2024-11-17 02:43:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 02:43:06,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:06,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:43:06,707 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 (3)] Forceful destruction successful, exit code 0 [2024-11-17 02:43:06,906 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-17 02:43:06,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr732REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:06,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:06,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1080546781, now seen corresponding path program 1 times [2024-11-17 02:43:06,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:06,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007015568] [2024-11-17 02:43:06,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:06,908 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-17 02:43:06,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:06,910 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-17 02:43:06,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 02:43:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:06,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:43:06,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:07,002 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-17 02:43:07,012 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-17 02:43:07,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:07,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:07,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007015568] [2024-11-17 02:43:07,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007015568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:07,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:07,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:43:07,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397167846] [2024-11-17 02:43:07,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:07,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:43:07,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:07,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:43:07,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:43:07,014 INFO L87 Difference]: Start difference. First operand 1365 states and 1441 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:43:08,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:08,946 INFO L93 Difference]: Finished difference Result 1693 states and 1789 transitions. [2024-11-17 02:43:08,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:43:08,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-17 02:43:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:08,958 INFO L225 Difference]: With dead ends: 1693 [2024-11-17 02:43:08,958 INFO L226 Difference]: Without dead ends: 1693 [2024-11-17 02:43:08,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:43:08,959 INFO L432 NwaCegarLoop]: 1164 mSDtfsCounter, 533 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:08,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1736 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 02:43:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2024-11-17 02:43:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1539. [2024-11-17 02:43:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 919 states have (on average 1.910772578890098) internal successors, (1756), 1531 states have internal predecessors, (1756), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:43:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 1768 transitions. [2024-11-17 02:43:09,010 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 1768 transitions. Word has length 7 [2024-11-17 02:43:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:09,010 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 1768 transitions. [2024-11-17 02:43:09,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:43:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1768 transitions. [2024-11-17 02:43:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:43:09,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:09,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:43:09,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 02:43:09,212 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-17 02:43:09,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:09,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:09,212 INFO L85 PathProgramCache]: Analyzing trace with hash 934044190, now seen corresponding path program 1 times [2024-11-17 02:43:09,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:09,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910557117] [2024-11-17 02:43:09,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:09,213 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-17 02:43:09,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:09,218 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-17 02:43:09,219 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-17 02:43:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:09,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 02:43:09,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:09,347 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-17 02:43:09,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:09,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:09,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910557117] [2024-11-17 02:43:09,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910557117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:09,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:09,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:43:09,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435897370] [2024-11-17 02:43:09,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:09,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:43:09,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:09,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:43:09,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:43:09,349 INFO L87 Difference]: Start difference. First operand 1539 states and 1768 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-17 02:43:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:09,856 INFO L93 Difference]: Finished difference Result 2323 states and 2678 transitions. [2024-11-17 02:43:09,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:43:09,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-17 02:43:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:09,861 INFO L225 Difference]: With dead ends: 2323 [2024-11-17 02:43:09,861 INFO L226 Difference]: Without dead ends: 2323 [2024-11-17 02:43:09,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-17 02:43:09,864 INFO L432 NwaCegarLoop]: 1395 mSDtfsCounter, 702 mSDsluCounter, 2543 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 3938 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:09,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 3938 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 02:43:09,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2024-11-17 02:43:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2024. [2024-11-17 02:43:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1404 states have (on average 1.8945868945868947) internal successors, (2660), 2013 states have internal predecessors, (2660), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:43:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2678 transitions. [2024-11-17 02:43:09,896 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2678 transitions. Word has length 9 [2024-11-17 02:43:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:09,897 INFO L471 AbstractCegarLoop]: Abstraction has 2024 states and 2678 transitions. [2024-11-17 02:43:09,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-17 02:43:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2678 transitions. [2024-11-17 02:43:09,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 02:43:09,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:09,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:43:09,907 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 (5)] Forceful destruction successful, exit code 0 [2024-11-17 02:43:10,099 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-17 02:43:10,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:10,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash -31741498, now seen corresponding path program 1 times [2024-11-17 02:43:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:10,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138201300] [2024-11-17 02:43:10,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:10,102 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-17 02:43:10,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:10,103 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-17 02:43:10,105 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-17 02:43:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:10,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:43:10,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:10,261 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-17 02:43:10,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:10,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:10,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138201300] [2024-11-17 02:43:10,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138201300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:10,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:10,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:43:10,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394306956] [2024-11-17 02:43:10,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:10,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:43:10,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:10,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:43:10,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:43:10,262 INFO L87 Difference]: Start difference. First operand 2024 states and 2678 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:43:10,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:10,377 INFO L93 Difference]: Finished difference Result 2102 states and 2620 transitions. [2024-11-17 02:43:10,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:43:10,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 02:43:10,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:10,383 INFO L225 Difference]: With dead ends: 2102 [2024-11-17 02:43:10,383 INFO L226 Difference]: Without dead ends: 2102 [2024-11-17 02:43:10,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:43:10,384 INFO L432 NwaCegarLoop]: 1469 mSDtfsCounter, 324 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:10,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 2800 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:43:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2024-11-17 02:43:10,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1879. [2024-11-17 02:43:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1259 states have (on average 1.903097696584591) internal successors, (2396), 1868 states have internal predecessors, (2396), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:43:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2414 transitions. [2024-11-17 02:43:10,409 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2414 transitions. Word has length 11 [2024-11-17 02:43:10,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:10,410 INFO L471 AbstractCegarLoop]: Abstraction has 1879 states and 2414 transitions. [2024-11-17 02:43:10,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:43:10,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2414 transitions. [2024-11-17 02:43:10,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 02:43:10,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:10,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:43:10,418 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-17 02:43:10,616 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-17 02:43:10,617 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr727REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:10,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:10,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1802598604, now seen corresponding path program 1 times [2024-11-17 02:43:10,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:10,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458212306] [2024-11-17 02:43:10,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:10,618 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-17 02:43:10,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:10,619 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-17 02:43:10,620 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-17 02:43:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:10,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 02:43:10,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:10,790 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-17 02:43:10,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:10,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:10,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458212306] [2024-11-17 02:43:10,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458212306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:10,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:10,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:43:10,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922667697] [2024-11-17 02:43:10,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:10,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:43:10,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:10,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:43:10,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:43:10,791 INFO L87 Difference]: Start difference. First operand 1879 states and 2414 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-17 02:43:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:10,832 INFO L93 Difference]: Finished difference Result 1819 states and 2328 transitions. [2024-11-17 02:43:10,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:43:10,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-11-17 02:43:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:10,841 INFO L225 Difference]: With dead ends: 1819 [2024-11-17 02:43:10,841 INFO L226 Difference]: Without dead ends: 1819 [2024-11-17 02:43:10,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-17 02:43:10,842 INFO L432 NwaCegarLoop]: 1343 mSDtfsCounter, 71 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2622 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-17 02:43:10,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2622 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:43:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2024-11-17 02:43:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1819. [2024-11-17 02:43:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1223 states have (on average 1.8887980376124285) internal successors, (2310), 1808 states have internal predecessors, (2310), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:43:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2328 transitions. [2024-11-17 02:43:10,905 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2328 transitions. Word has length 14 [2024-11-17 02:43:10,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:10,905 INFO L471 AbstractCegarLoop]: Abstraction has 1819 states and 2328 transitions. [2024-11-17 02:43:10,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-17 02:43:10,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2328 transitions. [2024-11-17 02:43:10,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 02:43:10,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:10,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:43:10,910 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-17 02:43:11,107 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-17 02:43:11,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:11,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:11,107 INFO L85 PathProgramCache]: Analyzing trace with hash -812407391, now seen corresponding path program 1 times [2024-11-17 02:43:11,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:11,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130442315] [2024-11-17 02:43:11,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:11,110 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-17 02:43:11,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:11,112 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-17 02:43:11,113 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-17 02:43:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:11,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 02:43:11,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:43:11,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:11,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:11,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130442315] [2024-11-17 02:43:11,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130442315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:11,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:11,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 02:43:11,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352600452] [2024-11-17 02:43:11,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:11,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:43:11,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:11,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:43:11,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:43:11,289 INFO L87 Difference]: Start difference. First operand 1819 states and 2328 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:43:12,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:12,380 INFO L93 Difference]: Finished difference Result 2018 states and 2533 transitions. [2024-11-17 02:43:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:43:12,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 02:43:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:12,391 INFO L225 Difference]: With dead ends: 2018 [2024-11-17 02:43:12,391 INFO L226 Difference]: Without dead ends: 2010 [2024-11-17 02:43:12,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:43:12,392 INFO L432 NwaCegarLoop]: 1426 mSDtfsCounter, 287 mSDsluCounter, 3671 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 5097 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:12,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 5097 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 02:43:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2024-11-17 02:43:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1811. [2024-11-17 02:43:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1215 states have (on average 1.8938271604938273) internal successors, (2301), 1800 states have internal predecessors, (2301), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:43:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2319 transitions. [2024-11-17 02:43:12,435 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2319 transitions. Word has length 15 [2024-11-17 02:43:12,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:12,436 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2319 transitions. [2024-11-17 02:43:12,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:43:12,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2319 transitions. [2024-11-17 02:43:12,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 02:43:12,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:12,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:43:12,440 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-17 02:43:12,637 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-17 02:43:12,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr703REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:12,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1425416032, now seen corresponding path program 1 times [2024-11-17 02:43:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:12,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355532585] [2024-11-17 02:43:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:12,638 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-17 02:43:12,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:12,640 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-17 02:43:12,641 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-17 02:43:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:12,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:43:12,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:12,761 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-17 02:43:12,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:12,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:12,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355532585] [2024-11-17 02:43:12,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355532585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:12,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:12,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:43:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643941332] [2024-11-17 02:43:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:12,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:43:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:12,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:43:12,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:43:12,763 INFO L87 Difference]: Start difference. First operand 1811 states and 2319 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:43:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:12,834 INFO L93 Difference]: Finished difference Result 1781 states and 2261 transitions. [2024-11-17 02:43:12,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:43:12,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-17 02:43:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:12,838 INFO L225 Difference]: With dead ends: 1781 [2024-11-17 02:43:12,838 INFO L226 Difference]: Without dead ends: 1781 [2024-11-17 02:43:12,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-17 02:43:12,839 INFO L432 NwaCegarLoop]: 1298 mSDtfsCounter, 48 mSDsluCounter, 2569 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3867 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-17 02:43:12,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3867 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:43:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2024-11-17 02:43:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1781. [2024-11-17 02:43:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1199 states have (on average 1.8707256046705587) internal successors, (2243), 1770 states have internal predecessors, (2243), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:43:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2261 transitions. [2024-11-17 02:43:12,859 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2261 transitions. Word has length 16 [2024-11-17 02:43:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:12,859 INFO L471 AbstractCegarLoop]: Abstraction has 1781 states and 2261 transitions. [2024-11-17 02:43:12,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:43:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2261 transitions. [2024-11-17 02:43:12,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 02:43:12,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:12,860 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] [2024-11-17 02:43:12,864 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 (9)] Forceful destruction successful, exit code 0 [2024-11-17 02:43:13,060 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-17 02:43:13,061 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr689REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:13,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:13,061 INFO L85 PathProgramCache]: Analyzing trace with hash -274570826, now seen corresponding path program 1 times [2024-11-17 02:43:13,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:13,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529955590] [2024-11-17 02:43:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:13,062 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-17 02:43:13,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:13,064 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-17 02:43:13,066 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-17 02:43:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:13,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:43:13,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:13,181 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-17 02:43:13,226 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-17 02:43:13,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:13,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:13,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529955590] [2024-11-17 02:43:13,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529955590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:13,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:13,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:43:13,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979958156] [2024-11-17 02:43:13,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:13,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:43:13,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:13,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:43:13,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:43:13,228 INFO L87 Difference]: Start difference. First operand 1781 states and 2261 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-17 02:43:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:14,995 INFO L93 Difference]: Finished difference Result 1785 states and 2261 transitions. [2024-11-17 02:43:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:43:14,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2024-11-17 02:43:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:14,999 INFO L225 Difference]: With dead ends: 1785 [2024-11-17 02:43:15,000 INFO L226 Difference]: Without dead ends: 1785 [2024-11-17 02:43:15,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-17 02:43:15,000 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 985 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:15,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 1456 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:43:15,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2024-11-17 02:43:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1777. [2024-11-17 02:43:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1199 states have (on average 1.8640533778148458) internal successors, (2235), 1766 states have internal predecessors, (2235), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:43:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2253 transitions. [2024-11-17 02:43:15,017 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2253 transitions. Word has length 30 [2024-11-17 02:43:15,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:15,017 INFO L471 AbstractCegarLoop]: Abstraction has 1777 states and 2253 transitions. [2024-11-17 02:43:15,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-17 02:43:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2253 transitions. [2024-11-17 02:43:15,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-17 02:43:15,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:15,018 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] [2024-11-17 02:43:15,022 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-17 02:43:15,221 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-17 02:43:15,221 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr690REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:15,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:15,222 INFO L85 PathProgramCache]: Analyzing trace with hash -274570825, now seen corresponding path program 1 times [2024-11-17 02:43:15,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:15,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546887155] [2024-11-17 02:43:15,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:15,222 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-17 02:43:15,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:15,225 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-17 02:43:15,226 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-17 02:43:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:15,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:43:15,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:15,345 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-17 02:43:15,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-17 02:43:15,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:15,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:15,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546887155] [2024-11-17 02:43:15,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546887155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:15,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:15,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:43:15,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248651538] [2024-11-17 02:43:15,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:15,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:43:15,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:15,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:43:15,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:43:15,460 INFO L87 Difference]: Start difference. First operand 1777 states and 2253 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-17 02:43:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:17,960 INFO L93 Difference]: Finished difference Result 1935 states and 2274 transitions. [2024-11-17 02:43:17,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:43:17,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2024-11-17 02:43:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:17,964 INFO L225 Difference]: With dead ends: 1935 [2024-11-17 02:43:17,965 INFO L226 Difference]: Without dead ends: 1935 [2024-11-17 02:43:17,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-17 02:43:17,965 INFO L432 NwaCegarLoop]: 1434 mSDtfsCounter, 466 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:17,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 2808 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-17 02:43:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2024-11-17 02:43:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1773. [2024-11-17 02:43:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1199 states have (on average 1.8573811509591327) internal successors, (2227), 1762 states have internal predecessors, (2227), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:43:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2245 transitions. [2024-11-17 02:43:17,982 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2245 transitions. Word has length 30 [2024-11-17 02:43:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:17,984 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2245 transitions. [2024-11-17 02:43:17,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-17 02:43:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2245 transitions. [2024-11-17 02:43:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 02:43:17,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:17,988 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-17 02:43:17,996 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-17 02:43:18,191 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-17 02:43:18,191 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr646REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:18,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:18,193 INFO L85 PathProgramCache]: Analyzing trace with hash -495584207, now seen corresponding path program 1 times [2024-11-17 02:43:18,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:18,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924467329] [2024-11-17 02:43:18,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:18,193 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-17 02:43:18,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:18,196 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-17 02:43:18,196 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-17 02:43:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:18,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:43:18,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:18,380 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-17 02:43:18,380 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:18,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:18,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924467329] [2024-11-17 02:43:18,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924467329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:18,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:18,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:43:18,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338242397] [2024-11-17 02:43:18,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:18,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:43:18,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:18,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:43:18,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:43:18,382 INFO L87 Difference]: Start difference. First operand 1773 states and 2245 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-17 02:43:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:18,426 INFO L93 Difference]: Finished difference Result 1761 states and 2225 transitions. [2024-11-17 02:43:18,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:43:18,427 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-17 02:43:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:18,430 INFO L225 Difference]: With dead ends: 1761 [2024-11-17 02:43:18,430 INFO L226 Difference]: Without dead ends: 1761 [2024-11-17 02:43:18,431 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-17 02:43:18,431 INFO L432 NwaCegarLoop]: 1292 mSDtfsCounter, 21 mSDsluCounter, 2552 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3844 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-17 02:43:18,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3844 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:43:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2024-11-17 02:43:18,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1761. [2024-11-17 02:43:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1187 states have (on average 1.8593091828138164) internal successors, (2207), 1750 states have internal predecessors, (2207), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:43:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2225 transitions. [2024-11-17 02:43:18,447 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2225 transitions. Word has length 50 [2024-11-17 02:43:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:18,447 INFO L471 AbstractCegarLoop]: Abstraction has 1761 states and 2225 transitions. [2024-11-17 02:43:18,447 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-17 02:43:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2225 transitions. [2024-11-17 02:43:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-17 02:43:18,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:18,450 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-17 02:43:18,459 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 (12)] Forceful destruction successful, exit code 0 [2024-11-17 02:43:18,654 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-17 02:43:18,654 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr646REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:18,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:18,655 INFO L85 PathProgramCache]: Analyzing trace with hash 241936761, now seen corresponding path program 1 times [2024-11-17 02:43:18,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:18,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098776042] [2024-11-17 02:43:18,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:18,656 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-17 02:43:18,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:18,658 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-17 02:43:18,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 (13)] Waiting until timeout for monitored process [2024-11-17 02:43:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:18,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 02:43:18,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:18,917 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-17 02:43:18,923 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-17 02:43:19,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:43:19,268 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-17 02:43:19,281 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:43:19,281 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-17 02:43:19,294 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-17 02:43:19,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:19,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:19,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098776042] [2024-11-17 02:43:19,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098776042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:19,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:19,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:43:19,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673935199] [2024-11-17 02:43:19,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:19,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:43:19,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:19,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:43:19,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:43:19,296 INFO L87 Difference]: Start difference. First operand 1761 states and 2225 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 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-17 02:43:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:20,857 INFO L93 Difference]: Finished difference Result 1677 states and 2100 transitions. [2024-11-17 02:43:20,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:43:20,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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-17 02:43:20,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:20,861 INFO L225 Difference]: With dead ends: 1677 [2024-11-17 02:43:20,863 INFO L226 Difference]: Without dead ends: 1677 [2024-11-17 02:43:20,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 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-17 02:43:20,864 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 1798 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:20,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1804 Valid, 690 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:43:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2024-11-17 02:43:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1493. [2024-11-17 02:43:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1003 states have (on average 1.7397806580259223) internal successors, (1745), 1482 states have internal predecessors, (1745), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:43:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1763 transitions. [2024-11-17 02:43:20,890 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1763 transitions. Word has length 58 [2024-11-17 02:43:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:20,891 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1763 transitions. [2024-11-17 02:43:20,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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-17 02:43:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1763 transitions. [2024-11-17 02:43:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-17 02:43:20,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:20,892 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] [2024-11-17 02:43:20,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-17 02:43:21,095 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-17 02:43:21,096 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr639REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:21,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:21,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1195681403, now seen corresponding path program 1 times [2024-11-17 02:43:21,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:21,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342767004] [2024-11-17 02:43:21,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:21,097 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-17 02:43:21,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:21,099 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-17 02:43:21,100 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-17 02:43:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:21,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 02:43:21,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:21,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:43:21,291 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-17 02:43:21,307 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-17 02:43:21,313 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-17 02:43:21,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:21,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:21,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342767004] [2024-11-17 02:43:21,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342767004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:21,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:21,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:43:21,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736410370] [2024-11-17 02:43:21,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:21,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:43:21,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:21,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:43:21,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:43:21,315 INFO L87 Difference]: Start difference. First operand 1493 states and 1763 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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-17 02:43:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:23,364 INFO L93 Difference]: Finished difference Result 1492 states and 1761 transitions. [2024-11-17 02:43:23,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:43:23,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2024-11-17 02:43:23,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:23,368 INFO L225 Difference]: With dead ends: 1492 [2024-11-17 02:43:23,369 INFO L226 Difference]: Without dead ends: 1492 [2024-11-17 02:43:23,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 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-17 02:43:23,369 INFO L432 NwaCegarLoop]: 1219 mSDtfsCounter, 2 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3087 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:23,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3087 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-17 02:43:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2024-11-17 02:43:23,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2024-11-17 02:43:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1003 states have (on average 1.7377866400797608) internal successors, (1743), 1481 states have internal predecessors, (1743), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:43:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1761 transitions. [2024-11-17 02:43:23,380 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1761 transitions. Word has length 63 [2024-11-17 02:43:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:23,381 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1761 transitions. [2024-11-17 02:43:23,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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-17 02:43:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1761 transitions. [2024-11-17 02:43:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-17 02:43:23,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:23,381 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] [2024-11-17 02:43:23,387 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 (14)] Forceful destruction successful, exit code 0 [2024-11-17 02:43:23,582 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-17 02:43:23,582 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:23,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:23,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1195681402, now seen corresponding path program 1 times [2024-11-17 02:43:23,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:23,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900965844] [2024-11-17 02:43:23,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:23,583 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-17 02:43:23,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:23,585 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-17 02:43:23,586 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-17 02:43:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:23,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 02:43:23,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:23,770 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-17 02:43:23,782 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-17 02:43:23,785 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-17 02:43:23,814 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-17 02:43:23,825 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-17 02:43:23,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:23,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:23,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900965844] [2024-11-17 02:43:23,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900965844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:23,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:23,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:43:23,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676853176] [2024-11-17 02:43:23,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:23,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:43:23,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:23,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:43:23,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:43:23,827 INFO L87 Difference]: Start difference. First operand 1492 states and 1761 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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-17 02:43:26,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:26,399 INFO L93 Difference]: Finished difference Result 1491 states and 1759 transitions. [2024-11-17 02:43:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:43:26,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2024-11-17 02:43:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:26,403 INFO L225 Difference]: With dead ends: 1491 [2024-11-17 02:43:26,403 INFO L226 Difference]: Without dead ends: 1491 [2024-11-17 02:43:26,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 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-17 02:43:26,404 INFO L432 NwaCegarLoop]: 1219 mSDtfsCounter, 1 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:26,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3132 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-17 02:43:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2024-11-17 02:43:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2024-11-17 02:43:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1001 states have (on average 1.7392607392607393) internal successors, (1741), 1480 states have internal predecessors, (1741), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:43:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1759 transitions. [2024-11-17 02:43:26,415 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1759 transitions. Word has length 63 [2024-11-17 02:43:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:26,415 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 1759 transitions. [2024-11-17 02:43:26,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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-17 02:43:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1759 transitions. [2024-11-17 02:43:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-17 02:43:26,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:26,416 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] [2024-11-17 02:43:26,423 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-17 02:43:26,620 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-17 02:43:26,621 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr636REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:26,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:26,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1645798211, now seen corresponding path program 1 times [2024-11-17 02:43:26,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:26,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277512394] [2024-11-17 02:43:26,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:26,622 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-17 02:43:26,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:26,624 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-17 02:43:26,625 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-17 02:43:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:26,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:43:26,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:26,830 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-17 02:43:26,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:43:26,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:26,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277512394] [2024-11-17 02:43:26,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277512394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:43:26,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:43:26,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:43:26,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127008058] [2024-11-17 02:43:26,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:43:26,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:43:26,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:26,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:43:26,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:43:26,832 INFO L87 Difference]: Start difference. First operand 1491 states and 1759 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-17 02:43:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:26,871 INFO L93 Difference]: Finished difference Result 1494 states and 1765 transitions. [2024-11-17 02:43:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:43:26,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 71 [2024-11-17 02:43:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:26,877 INFO L225 Difference]: With dead ends: 1494 [2024-11-17 02:43:26,877 INFO L226 Difference]: Without dead ends: 1494 [2024-11-17 02:43:26,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 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-17 02:43:26,878 INFO L432 NwaCegarLoop]: 1218 mSDtfsCounter, 0 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3646 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:26,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3646 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:43:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2024-11-17 02:43:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1494. [2024-11-17 02:43:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1003 states have (on average 1.7387836490528414) internal successors, (1744), 1483 states have internal predecessors, (1744), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 02:43:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1765 transitions. [2024-11-17 02:43:26,901 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1765 transitions. Word has length 71 [2024-11-17 02:43:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:26,902 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 1765 transitions. [2024-11-17 02:43:26,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-17 02:43:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1765 transitions. [2024-11-17 02:43:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 02:43:26,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:26,903 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] [2024-11-17 02:43:26,915 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 (16)] Forceful destruction successful, exit code 0 [2024-11-17 02:43:27,103 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-17 02:43:27,104 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr636REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:27,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:27,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1316040255, now seen corresponding path program 1 times [2024-11-17 02:43:27,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:27,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17181999] [2024-11-17 02:43:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:43:27,105 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-17 02:43:27,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:27,106 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-17 02:43:27,108 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-17 02:43:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:43:27,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:43:27,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:27,344 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-17 02:43:27,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:43:27,398 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-17 02:43:27,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:27,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17181999] [2024-11-17 02:43:27,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17181999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:43:27,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:43:27,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 02:43:27,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568078031] [2024-11-17 02:43:27,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:43:27,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 02:43:27,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:27,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 02:43:27,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 02:43:27,399 INFO L87 Difference]: Start difference. First operand 1494 states and 1765 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-17 02:43:27,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:27,531 INFO L93 Difference]: Finished difference Result 1506 states and 1784 transitions. [2024-11-17 02:43:27,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:43:27,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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 72 [2024-11-17 02:43:27,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:27,535 INFO L225 Difference]: With dead ends: 1506 [2024-11-17 02:43:27,535 INFO L226 Difference]: Without dead ends: 1506 [2024-11-17 02:43:27,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 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-17 02:43:27,539 INFO L432 NwaCegarLoop]: 1217 mSDtfsCounter, 8 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3646 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:27,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3646 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:43:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-17 02:43:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1504. [2024-11-17 02:43:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1012 states have (on average 1.7381422924901186) internal successors, (1759), 1492 states have internal predecessors, (1759), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 02:43:27,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1780 transitions. [2024-11-17 02:43:27,564 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1780 transitions. Word has length 72 [2024-11-17 02:43:27,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:27,564 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1780 transitions. [2024-11-17 02:43:27,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-17 02:43:27,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1780 transitions. [2024-11-17 02:43:27,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-17 02:43:27,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:27,569 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] [2024-11-17 02:43:27,583 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-17 02:43:27,769 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-17 02:43:27,770 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr636REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:27,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:27,770 INFO L85 PathProgramCache]: Analyzing trace with hash -615398845, now seen corresponding path program 2 times [2024-11-17 02:43:27,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:27,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926802067] [2024-11-17 02:43:27,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 02:43:27,771 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-17 02:43:27,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:27,773 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-17 02:43:27,774 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-17 02:43:28,075 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 02:43:28,076 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:43:28,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 02:43:28,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:28,127 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-17 02:43:28,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:43:28,242 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-17 02:43:28,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:28,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926802067] [2024-11-17 02:43:28,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926802067] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:43:28,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:43:28,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 02:43:28,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755057292] [2024-11-17 02:43:28,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:43:28,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:43:28,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:28,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:43:28,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:43:28,244 INFO L87 Difference]: Start difference. First operand 1504 states and 1780 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:43:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:28,588 INFO L93 Difference]: Finished difference Result 1519 states and 1804 transitions. [2024-11-17 02:43:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 02:43:28,589 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-17 02:43:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:28,592 INFO L225 Difference]: With dead ends: 1519 [2024-11-17 02:43:28,592 INFO L226 Difference]: Without dead ends: 1515 [2024-11-17 02:43:28,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-17 02:43:28,593 INFO L432 NwaCegarLoop]: 1217 mSDtfsCounter, 14 mSDsluCounter, 7279 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8496 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:28,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8496 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:43:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-17 02:43:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2024-11-17 02:43:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1021 states have (on average 1.7345739471106758) internal successors, (1771), 1501 states have internal predecessors, (1771), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 02:43:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1792 transitions. [2024-11-17 02:43:28,605 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1792 transitions. Word has length 75 [2024-11-17 02:43:28,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:28,606 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1792 transitions. [2024-11-17 02:43:28,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:43:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1792 transitions. [2024-11-17 02:43:28,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-17 02:43:28,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:28,606 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] [2024-11-17 02:43:28,614 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-17 02:43:28,810 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-17 02:43:28,811 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr636REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:28,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:28,811 INFO L85 PathProgramCache]: Analyzing trace with hash 947192003, now seen corresponding path program 3 times [2024-11-17 02:43:28,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:28,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332867521] [2024-11-17 02:43:28,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 02:43:28,812 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-17 02:43:28,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:28,814 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-17 02:43:28,815 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-17 02:43:29,262 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-17 02:43:29,262 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:43:29,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 02:43:29,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:29,386 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-17 02:43:29,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:43:29,798 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-17 02:43:29,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:29,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332867521] [2024-11-17 02:43:29,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332867521] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:43:29,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:43:29,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 02:43:29,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546475238] [2024-11-17 02:43:29,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:43:29,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 02:43:29,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:29,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 02:43:29,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 02:43:29,801 INFO L87 Difference]: Start difference. First operand 1513 states and 1792 transitions. Second operand has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 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-17 02:43:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:31,043 INFO L93 Difference]: Finished difference Result 1537 states and 1831 transitions. [2024-11-17 02:43:31,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 02:43:31,044 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 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 81 [2024-11-17 02:43:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:31,046 INFO L225 Difference]: With dead ends: 1537 [2024-11-17 02:43:31,047 INFO L226 Difference]: Without dead ends: 1531 [2024-11-17 02:43:31,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 02:43:31,047 INFO L432 NwaCegarLoop]: 1218 mSDtfsCounter, 23 mSDsluCounter, 13354 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 14572 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:31,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 14572 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 02:43:31,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2024-11-17 02:43:31,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2024-11-17 02:43:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1039 states have (on average 1.7266602502406159) internal successors, (1794), 1519 states have internal predecessors, (1794), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 02:43:31,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1815 transitions. [2024-11-17 02:43:31,060 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1815 transitions. Word has length 81 [2024-11-17 02:43:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:31,060 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 1815 transitions. [2024-11-17 02:43:31,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 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-17 02:43:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1815 transitions. [2024-11-17 02:43:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-17 02:43:31,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:31,061 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] [2024-11-17 02:43:31,069 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 (19)] Ended with exit code 0 [2024-11-17 02:43:31,265 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-17 02:43:31,266 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr636REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:31,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:31,266 INFO L85 PathProgramCache]: Analyzing trace with hash -494346813, now seen corresponding path program 4 times [2024-11-17 02:43:31,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:31,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485140086] [2024-11-17 02:43:31,267 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 02:43:31,267 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-17 02:43:31,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:31,269 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-17 02:43:31,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-17 02:43:31,582 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 02:43:31,582 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:43:31,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 02:43:31,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:31,891 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-17 02:43:31,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:43:32,969 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-17 02:43:32,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:32,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485140086] [2024-11-17 02:43:32,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485140086] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:43:32,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:43:32,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 02:43:32,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781300559] [2024-11-17 02:43:32,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:43:32,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 02:43:32,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:43:32,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 02:43:32,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 02:43:32,972 INFO L87 Difference]: Start difference. First operand 1531 states and 1815 transitions. Second operand has 50 states, 50 states have (on average 2.32) internal successors, (116), 50 states have internal predecessors, (116), 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-17 02:43:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:43:37,393 INFO L93 Difference]: Finished difference Result 1571 states and 1889 transitions. [2024-11-17 02:43:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 02:43:37,394 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.32) internal successors, (116), 50 states have internal predecessors, (116), 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 93 [2024-11-17 02:43:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:43:37,397 INFO L225 Difference]: With dead ends: 1571 [2024-11-17 02:43:37,397 INFO L226 Difference]: Without dead ends: 1567 [2024-11-17 02:43:37,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 02:43:37,399 INFO L432 NwaCegarLoop]: 1217 mSDtfsCounter, 35 mSDsluCounter, 27902 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 29119 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:43:37,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 29119 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:43:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-11-17 02:43:37,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1565. [2024-11-17 02:43:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1073 states have (on average 1.7148182665424045) internal successors, (1840), 1553 states have internal predecessors, (1840), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-17 02:43:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1861 transitions. [2024-11-17 02:43:37,414 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1861 transitions. Word has length 93 [2024-11-17 02:43:37,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:43:37,415 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 1861 transitions. [2024-11-17 02:43:37,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.32) internal successors, (116), 50 states have internal predecessors, (116), 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-17 02:43:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1861 transitions. [2024-11-17 02:43:37,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-17 02:43:37,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:43:37,415 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] [2024-11-17 02:43:37,425 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 (20)] Forceful destruction successful, exit code 0 [2024-11-17 02:43:37,616 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-17 02:43:37,617 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr636REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 730 more)] === [2024-11-17 02:43:37,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:43:37,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1580070979, now seen corresponding path program 5 times [2024-11-17 02:43:37,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:43:37,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959025227] [2024-11-17 02:43:37,618 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 02:43:37,618 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-17 02:43:37,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:43:37,620 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-17 02:43:37,635 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-17 02:43:38,766 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-17 02:43:38,766 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:43:38,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-17 02:43:38,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:43:38,805 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-17 02:43:38,977 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:43:38,978 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-17 02:43:38,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:43:39,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 02:43:39,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 02:43:39,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-17 02:43:39,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-17 02:43:39,804 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 02:43:39,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-17 02:43:39,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-17 02:43:39,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-17 02:43:39,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-17 02:43:39,858 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-17 02:43:39,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:43:40,806 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1686 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1687) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1686 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2024-11-17 02:43:40,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:43:40,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959025227] [2024-11-17 02:43:40,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959025227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:43:40,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1131195024] [2024-11-17 02:43:40,810 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 02:43:40,811 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-17 02:43:40,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-17 02:43:40,813 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-17 02:43:40,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process