./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.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_SFH_test5-3.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 94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:02:12,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:02:12,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:02:12,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:02:12,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:02:12,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:02:12,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:02:12,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:02:12,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:02:12,647 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:02:12,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:02:12,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:02:12,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:02:12,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:02:12,649 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:02:12,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:02:12,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:02:12,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:02:12,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:02:12,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:02:12,654 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:02:12,656 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:02:12,657 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:02:12,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:02:12,657 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:02:12,657 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:02:12,658 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:02:12,658 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:02:12,658 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:02:12,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:02:12,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:02:12,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:02:12,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:02:12,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:02:12,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:02:12,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:02:12,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:02:12,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:02:12,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:02:12,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:02:12,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:02:12,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:02:12,663 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 -> 94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0 [2024-11-17 03:02:12,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:02:12,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:02:12,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:02:12,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:02:12,947 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:02:12,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2024-11-17 03:02:14,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:02:14,797 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:02:14,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2024-11-17 03:02:14,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d966e7b/5a8efe092ef44466972b76d57379679d/FLAG5d1db8345 [2024-11-17 03:02:14,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d966e7b/5a8efe092ef44466972b76d57379679d [2024-11-17 03:02:14,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:02:14,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:02:14,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:02:14,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:02:14,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:02:14,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:02:14" (1/1) ... [2024-11-17 03:02:14,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f1797f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:14, skipping insertion in model container [2024-11-17 03:02:14,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:02:14" (1/1) ... [2024-11-17 03:02:14,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:02:15,300 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 03:02:15,332 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 03:02:15,336 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 03:02:15,341 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 03:02:15,348 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 03:02:15,372 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 03:02:15,374 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 03:02:15,376 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 03:02:15,381 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 03:02:15,403 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 03:02:15,403 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 03:02:15,405 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 03:02:15,406 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 03:02:15,408 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 03:02:15,410 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 03:02:15,411 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 03:02:15,412 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 03:02:15,413 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 03:02:15,417 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 03:02:15,418 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 03:02:15,419 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 03:02:15,420 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 03:02:15,452 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 03:02:15,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:02:15,486 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 03:02:15,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6fea9cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:15, skipping insertion in model container [2024-11-17 03:02:15,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:02:15,489 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 03:02:15,490 INFO L158 Benchmark]: Toolchain (without parser) took 640.91ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 133.8MB in the end (delta: -25.4MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2024-11-17 03:02:15,491 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:02:15,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 638.78ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 133.8MB in the end (delta: -25.8MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2024-11-17 03:02:15,492 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.13ms. Allocated memory is still 167.8MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 638.78ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 133.8MB in the end (delta: -25.8MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 760]: 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_SFH_test5-3.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 94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:02:17,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:02:17,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 03:02:17,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:02:17,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:02:17,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:02:17,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:02:17,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:02:17,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:02:17,687 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:02:17,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:02:17,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:02:17,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:02:17,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:02:17,690 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:02:17,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:02:17,691 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:02:17,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:02:17,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:02:17,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:02:17,695 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:02:17,696 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:02:17,696 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:02:17,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:02:17,697 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:02:17,697 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:02:17,697 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:02:17,706 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:02:17,706 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:02:17,706 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:02:17,707 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:02:17,707 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:02:17,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:02:17,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:02:17,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:02:17,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:02:17,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:02:17,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:02:17,708 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:02:17,708 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:02:17,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:02:17,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:02:17,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:02:17,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:02:17,711 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 -> 94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0 [2024-11-17 03:02:18,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:02:18,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:02:18,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:02:18,049 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:02:18,050 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:02:18,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2024-11-17 03:02:19,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:02:19,890 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:02:19,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2024-11-17 03:02:19,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/486b03d15/95458bf83b024cb8b46417932e0d9c8c/FLAG9b1c1bc6b [2024-11-17 03:02:19,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/486b03d15/95458bf83b024cb8b46417932e0d9c8c [2024-11-17 03:02:19,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:02:19,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:02:19,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:02:19,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:02:19,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:02:19,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:02:19" (1/1) ... [2024-11-17 03:02:19,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c0655b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:19, skipping insertion in model container [2024-11-17 03:02:19,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:02:19" (1/1) ... [2024-11-17 03:02:20,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:02:20,425 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 03:02:20,464 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 03:02:20,471 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 03:02:20,476 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 03:02:20,490 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 03:02:20,521 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 03:02:20,523 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 03:02:20,525 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 03:02:20,529 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 03:02:20,563 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 03:02:20,563 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 03:02:20,568 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 03:02:20,569 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 03:02:20,571 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 03:02:20,574 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 03:02:20,575 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 03:02:20,576 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 03:02:20,577 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 03:02:20,586 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 03:02:20,587 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 03:02:20,588 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 03:02:20,589 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 03:02:20,596 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 03:02:20,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:02:20,628 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 03:02:20,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:02:20,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 03:02:20,695 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 03:02:20,697 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 03:02:20,702 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 03:02:20,706 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 03:02:20,726 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 03:02:20,728 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 03:02:20,731 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 03:02:20,734 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 03:02:20,752 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 03:02:20,753 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 03:02:20,758 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 03:02:20,758 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 03:02:20,759 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 03:02:20,761 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 03:02:20,767 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 03:02:20,767 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 03:02:20,768 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 03:02:20,774 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 03:02:20,775 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 03:02:20,776 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 03:02:20,776 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 03:02:20,778 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 03:02:20,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:02:20,790 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:02:20,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:02:20,944 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:02:20,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:20 WrapperNode [2024-11-17 03:02:20,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:02:20,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:02:20,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:02:20,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:02:20,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:20" (1/1) ... [2024-11-17 03:02:20,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:20" (1/1) ... [2024-11-17 03:02:21,066 INFO L138 Inliner]: procedures = 180, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1704 [2024-11-17 03:02:21,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:02:21,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:02:21,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:02:21,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:02:21,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:20" (1/1) ... [2024-11-17 03:02:21,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:20" (1/1) ... [2024-11-17 03:02:21,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:20" (1/1) ... [2024-11-17 03:02:21,280 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [417, 2, 24]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 99 writes are split as follows [98, 0, 1]. [2024-11-17 03:02:21,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:20" (1/1) ... [2024-11-17 03:02:21,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:20" (1/1) ... [2024-11-17 03:02:21,347 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:20" (1/1) ... [2024-11-17 03:02:21,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:20" (1/1) ... [2024-11-17 03:02:21,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:20" (1/1) ... [2024-11-17 03:02:21,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:20" (1/1) ... [2024-11-17 03:02:21,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:02:21,389 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:02:21,389 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:02:21,389 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:02:21,390 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:20" (1/1) ... [2024-11-17 03:02:21,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:02:21,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:02:21,427 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 03:02:21,434 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 03:02:21,475 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 03:02:21,475 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 03:02:21,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 03:02:21,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 03:02:21,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 03:02:21,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 03:02:21,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 03:02:21,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 03:02:21,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 03:02:21,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 03:02:21,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 03:02:21,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 03:02:21,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 03:02:21,478 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 03:02:21,478 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 03:02:21,479 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 03:02:21,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 03:02:21,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:02:21,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 03:02:21,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 03:02:21,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 03:02:21,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 03:02:21,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 03:02:21,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 03:02:21,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 03:02:21,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 03:02:21,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 03:02:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 03:02:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 03:02:21,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:02:21,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 03:02:21,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 03:02:21,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:02:21,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:02:21,761 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:02:21,764 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:02:27,264 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2024-11-17 03:02:27,493 INFO L? ?]: Removed 1906 outVars from TransFormulas that were not future-live. [2024-11-17 03:02:27,493 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:02:27,536 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:02:27,536 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:02:27,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:02:27 BoogieIcfgContainer [2024-11-17 03:02:27,541 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:02:27,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:02:27,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:02:27,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:02:27,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:02:19" (1/3) ... [2024-11-17 03:02:27,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4ef019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:02:27, skipping insertion in model container [2024-11-17 03:02:27,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:02:20" (2/3) ... [2024-11-17 03:02:27,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4ef019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:02:27, skipping insertion in model container [2024-11-17 03:02:27,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:02:27" (3/3) ... [2024-11-17 03:02:27,553 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-3.i [2024-11-17 03:02:27,570 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:02:27,570 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 915 error locations. [2024-11-17 03:02:27,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:02:27,664 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;@b9cc3e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:02:27,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 915 error locations. [2024-11-17 03:02:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 1865 states, 939 states have (on average 2.1831735889243875) internal successors, (2050), 1855 states have internal predecessors, (2050), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:02:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 03:02:27,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:27,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 03:02:27,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr912REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:27,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:27,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1856517027, now seen corresponding path program 1 times [2024-11-17 03:02:27,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:27,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154717122] [2024-11-17 03:02:27,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:27,693 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 03:02:27,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:27,695 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 03:02:27,696 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 03:02:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:27,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 03:02:27,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:27,895 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 03:02:27,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:02:27,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:27,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154717122] [2024-11-17 03:02:27,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154717122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:02:27,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:02:27,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:02:27,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596437803] [2024-11-17 03:02:27,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:02:27,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 03:02:27,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:27,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 03:02:27,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 03:02:27,954 INFO L87 Difference]: Start difference. First operand has 1865 states, 939 states have (on average 2.1831735889243875) internal successors, (2050), 1855 states have internal predecessors, (2050), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:28,157 INFO L93 Difference]: Finished difference Result 1843 states and 1944 transitions. [2024-11-17 03:02:28,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 03:02:28,159 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 03:02:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:28,192 INFO L225 Difference]: With dead ends: 1843 [2024-11-17 03:02:28,195 INFO L226 Difference]: Without dead ends: 1840 [2024-11-17 03:02:28,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 03:02:28,200 INFO L432 NwaCegarLoop]: 1944 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:28,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:02:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2024-11-17 03:02:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2024-11-17 03:02:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 926 states have (on average 2.070194384449244) internal successors, (1917), 1830 states have internal predecessors, (1917), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 03:02:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 1941 transitions. [2024-11-17 03:02:28,316 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 1941 transitions. Word has length 6 [2024-11-17 03:02:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:28,318 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 1941 transitions. [2024-11-17 03:02:28,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 1941 transitions. [2024-11-17 03:02:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 03:02:28,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:28,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 03:02:28,327 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 03:02:28,522 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 03:02:28,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr912REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:28,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:28,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1856516996, now seen corresponding path program 1 times [2024-11-17 03:02:28,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:28,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146825316] [2024-11-17 03:02:28,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:28,524 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 03:02:28,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:28,526 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 03:02:28,527 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 03:02:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:28,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:02:28,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:28,746 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 03:02:28,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 03:02:28,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:02:28,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:28,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146825316] [2024-11-17 03:02:28,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146825316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:02:28,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:02:28,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:02:28,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389462175] [2024-11-17 03:02:28,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:02:28,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:02:28,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:28,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:02:28,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:02:28,765 INFO L87 Difference]: Start difference. First operand 1840 states and 1941 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:30,943 INFO L93 Difference]: Finished difference Result 1984 states and 2117 transitions. [2024-11-17 03:02:30,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:02:30,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 03:02:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:30,951 INFO L225 Difference]: With dead ends: 1984 [2024-11-17 03:02:30,952 INFO L226 Difference]: Without dead ends: 1984 [2024-11-17 03:02:30,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 03:02:30,953 INFO L432 NwaCegarLoop]: 1412 mSDtfsCounter, 1290 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:30,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1301 Valid, 1802 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-17 03:02:30,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2024-11-17 03:02:30,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1748. [2024-11-17 03:02:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 926 states have (on average 1.970842332613391) internal successors, (1825), 1738 states have internal predecessors, (1825), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 03:02:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 1849 transitions. [2024-11-17 03:02:31,007 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 1849 transitions. Word has length 6 [2024-11-17 03:02:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:31,008 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 1849 transitions. [2024-11-17 03:02:31,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 1849 transitions. [2024-11-17 03:02:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 03:02:31,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:31,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 03:02:31,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 03:02:31,210 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 03:02:31,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr913REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:31,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1856516995, now seen corresponding path program 1 times [2024-11-17 03:02:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:31,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104029644] [2024-11-17 03:02:31,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:31,212 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 03:02:31,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:31,215 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 03:02:31,216 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 03:02:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:31,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:02:31,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:31,379 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 03:02:31,400 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 03:02:31,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:02:31,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:31,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104029644] [2024-11-17 03:02:31,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104029644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:02:31,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:02:31,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:02:31,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136539660] [2024-11-17 03:02:31,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:02:31,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:02:31,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:31,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:02:31,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:02:31,405 INFO L87 Difference]: Start difference. First operand 1748 states and 1849 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:34,360 INFO L93 Difference]: Finished difference Result 2309 states and 2461 transitions. [2024-11-17 03:02:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:02:34,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 03:02:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:34,369 INFO L225 Difference]: With dead ends: 2309 [2024-11-17 03:02:34,369 INFO L226 Difference]: Without dead ends: 2309 [2024-11-17 03:02:34,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 03:02:34,370 INFO L432 NwaCegarLoop]: 1777 mSDtfsCounter, 786 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2619 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:34,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 2619 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-17 03:02:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2024-11-17 03:02:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 1922. [2024-11-17 03:02:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1110 states have (on average 1.9387387387387387) internal successors, (2152), 1912 states have internal predecessors, (2152), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 03:02:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2176 transitions. [2024-11-17 03:02:34,414 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2176 transitions. Word has length 6 [2024-11-17 03:02:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:34,414 INFO L471 AbstractCegarLoop]: Abstraction has 1922 states and 2176 transitions. [2024-11-17 03:02:34,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2176 transitions. [2024-11-17 03:02:34,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 03:02:34,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:34,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:02:34,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-17 03:02:34,615 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 03:02:34,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr292REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:34,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:34,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1743973832, now seen corresponding path program 1 times [2024-11-17 03:02:34,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:34,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520135690] [2024-11-17 03:02:34,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:34,617 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 03:02:34,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:34,621 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 03:02:34,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 03:02:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:34,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:02:34,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:34,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:02:34,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:02:34,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:34,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520135690] [2024-11-17 03:02:34,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520135690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:02:34,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:02:34,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:02:34,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325886411] [2024-11-17 03:02:34,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:02:34,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:02:34,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:34,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:02:34,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:02:34,771 INFO L87 Difference]: Start difference. First operand 1922 states and 2176 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:34,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:34,933 INFO L93 Difference]: Finished difference Result 3432 states and 3921 transitions. [2024-11-17 03:02:34,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:02:34,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 03:02:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:34,948 INFO L225 Difference]: With dead ends: 3432 [2024-11-17 03:02:34,949 INFO L226 Difference]: Without dead ends: 3432 [2024-11-17 03:02:34,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:02:34,950 INFO L432 NwaCegarLoop]: 2110 mSDtfsCounter, 1382 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 3939 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:34,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 3939 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:02:34,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2024-11-17 03:02:35,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 1926. [2024-11-17 03:02:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1114 states have (on average 1.9353680430879712) internal successors, (2156), 1916 states have internal predecessors, (2156), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 03:02:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2180 transitions. [2024-11-17 03:02:35,013 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2180 transitions. Word has length 8 [2024-11-17 03:02:35,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:35,014 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 2180 transitions. [2024-11-17 03:02:35,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:35,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2180 transitions. [2024-11-17 03:02:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 03:02:35,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:35,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:02:35,020 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 03:02:35,215 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 03:02:35,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr908REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:35,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:35,216 INFO L85 PathProgramCache]: Analyzing trace with hash -473468332, now seen corresponding path program 1 times [2024-11-17 03:02:35,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:35,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417320155] [2024-11-17 03:02:35,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:35,219 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 03:02:35,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:35,222 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 03:02:35,224 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 03:02:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:35,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:02:35,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:35,389 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 03:02:35,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:02:35,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:35,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417320155] [2024-11-17 03:02:35,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417320155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:02:35,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:02:35,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:02:35,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094061291] [2024-11-17 03:02:35,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:02:35,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:02:35,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:35,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:02:35,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:02:35,392 INFO L87 Difference]: Start difference. First operand 1926 states and 2180 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:35,431 INFO L93 Difference]: Finished difference Result 1884 states and 2137 transitions. [2024-11-17 03:02:35,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:02:35,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-17 03:02:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:35,438 INFO L225 Difference]: With dead ends: 1884 [2024-11-17 03:02:35,438 INFO L226 Difference]: Without dead ends: 1884 [2024-11-17 03:02:35,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:02:35,439 INFO L432 NwaCegarLoop]: 1784 mSDtfsCounter, 71 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3504 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 03:02:35,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3504 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:02:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2024-11-17 03:02:35,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1884. [2024-11-17 03:02:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1096 states have (on average 1.927919708029197) internal successors, (2113), 1874 states have internal predecessors, (2113), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 03:02:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2137 transitions. [2024-11-17 03:02:35,475 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2137 transitions. Word has length 13 [2024-11-17 03:02:35,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:35,475 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 2137 transitions. [2024-11-17 03:02:35,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:35,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2137 transitions. [2024-11-17 03:02:35,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 03:02:35,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:35,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:02:35,481 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 03:02:35,676 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 03:02:35,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr884REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:35,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:35,677 INFO L85 PathProgramCache]: Analyzing trace with hash 263459624, now seen corresponding path program 1 times [2024-11-17 03:02:35,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:35,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749440968] [2024-11-17 03:02:35,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:35,678 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 03:02:35,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:35,680 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 03:02:35,681 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 03:02:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:35,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:02:35,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:35,853 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 03:02:35,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:02:35,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:35,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749440968] [2024-11-17 03:02:35,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749440968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:02:35,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:02:35,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:02:35,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930048328] [2024-11-17 03:02:35,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:02:35,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:02:35,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:35,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:02:35,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:02:35,855 INFO L87 Difference]: Start difference. First operand 1884 states and 2137 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:35,942 INFO L93 Difference]: Finished difference Result 1862 states and 2108 transitions. [2024-11-17 03:02:35,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:02:35,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 03:02:35,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:35,949 INFO L225 Difference]: With dead ends: 1862 [2024-11-17 03:02:35,949 INFO L226 Difference]: Without dead ends: 1862 [2024-11-17 03:02:35,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:02:35,950 INFO L432 NwaCegarLoop]: 1739 mSDtfsCounter, 48 mSDsluCounter, 3451 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 5190 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.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:35,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 5190 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:02:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2024-11-17 03:02:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1862. [2024-11-17 03:02:35,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1088 states have (on average 1.9154411764705883) internal successors, (2084), 1852 states have internal predecessors, (2084), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 03:02:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2108 transitions. [2024-11-17 03:02:35,980 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2108 transitions. Word has length 15 [2024-11-17 03:02:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:35,981 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2108 transitions. [2024-11-17 03:02:35,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2108 transitions. [2024-11-17 03:02:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 03:02:35,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:35,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:02:35,988 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 03:02:36,182 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 03:02:36,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr870REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:36,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:36,183 INFO L85 PathProgramCache]: Analyzing trace with hash -625185474, now seen corresponding path program 1 times [2024-11-17 03:02:36,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:36,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325682590] [2024-11-17 03:02:36,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:36,184 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 03:02:36,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:36,185 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 03:02:36,187 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 03:02:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:36,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:02:36,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:36,368 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 03:02:36,438 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 03:02:36,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:02:36,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:36,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325682590] [2024-11-17 03:02:36,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325682590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:02:36,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:02:36,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:02:36,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518528260] [2024-11-17 03:02:36,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:02:36,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:02:36,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:36,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:02:36,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:02:36,440 INFO L87 Difference]: Start difference. First operand 1862 states and 2108 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:38,877 INFO L93 Difference]: Finished difference Result 1862 states and 2108 transitions. [2024-11-17 03:02:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:02:38,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-17 03:02:38,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:38,884 INFO L225 Difference]: With dead ends: 1862 [2024-11-17 03:02:38,884 INFO L226 Difference]: Without dead ends: 1862 [2024-11-17 03:02:38,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:02:38,885 INFO L432 NwaCegarLoop]: 1105 mSDtfsCounter, 1227 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:38,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 2157 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1855 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-17 03:02:38,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2024-11-17 03:02:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1858. [2024-11-17 03:02:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1088 states have (on average 1.911764705882353) internal successors, (2080), 1848 states have internal predecessors, (2080), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 03:02:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2104 transitions. [2024-11-17 03:02:38,912 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2104 transitions. Word has length 29 [2024-11-17 03:02:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:38,913 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2104 transitions. [2024-11-17 03:02:38,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2104 transitions. [2024-11-17 03:02:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 03:02:38,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:38,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:02:38,920 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 03:02:39,115 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 03:02:39,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr871REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:39,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash -625185473, now seen corresponding path program 1 times [2024-11-17 03:02:39,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:39,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141640587] [2024-11-17 03:02:39,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:39,118 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 03:02:39,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:39,121 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 03:02:39,122 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 03:02:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:39,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 03:02:39,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:39,314 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 03:02:39,482 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 03:02:39,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:02:39,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:39,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141640587] [2024-11-17 03:02:39,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141640587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:02:39,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:02:39,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:02:39,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124178385] [2024-11-17 03:02:39,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:02:39,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:02:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:39,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:02:39,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:02:39,485 INFO L87 Difference]: Start difference. First operand 1858 states and 2104 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:42,693 INFO L93 Difference]: Finished difference Result 2247 states and 2391 transitions. [2024-11-17 03:02:42,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:02:42,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-17 03:02:42,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:42,700 INFO L225 Difference]: With dead ends: 2247 [2024-11-17 03:02:42,700 INFO L226 Difference]: Without dead ends: 2247 [2024-11-17 03:02:42,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:02:42,701 INFO L432 NwaCegarLoop]: 1469 mSDtfsCounter, 719 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 3179 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:42,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 3179 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-17 03:02:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2024-11-17 03:02:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1854. [2024-11-17 03:02:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1088 states have (on average 1.9080882352941178) internal successors, (2076), 1844 states have internal predecessors, (2076), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 03:02:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2100 transitions. [2024-11-17 03:02:42,734 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2100 transitions. Word has length 29 [2024-11-17 03:02:42,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:42,735 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2100 transitions. [2024-11-17 03:02:42,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2100 transitions. [2024-11-17 03:02:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-17 03:02:42,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:42,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:02:42,744 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 03:02:42,942 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 03:02:42,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr856REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:42,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1694067996, now seen corresponding path program 1 times [2024-11-17 03:02:42,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:42,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056931945] [2024-11-17 03:02:42,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:42,944 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 03:02:42,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:42,945 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 03:02:42,947 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 03:02:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:43,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:02:43,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:43,176 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 03:02:43,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:02:43,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:43,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056931945] [2024-11-17 03:02:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056931945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:02:43,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:02:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:02:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213393474] [2024-11-17 03:02:43,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:02:43,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:02:43,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:43,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:02:43,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:02:43,179 INFO L87 Difference]: Start difference. First operand 1854 states and 2100 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:43,248 INFO L93 Difference]: Finished difference Result 1848 states and 2090 transitions. [2024-11-17 03:02:43,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:02:43,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-17 03:02:43,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:43,253 INFO L225 Difference]: With dead ends: 1848 [2024-11-17 03:02:43,253 INFO L226 Difference]: Without dead ends: 1848 [2024-11-17 03:02:43,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:02:43,255 INFO L432 NwaCegarLoop]: 1733 mSDtfsCounter, 21 mSDsluCounter, 3434 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5167 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 03:02:43,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5167 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:02:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2024-11-17 03:02:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1848. [2024-11-17 03:02:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1082 states have (on average 1.9094269870609981) internal successors, (2066), 1838 states have internal predecessors, (2066), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 03:02:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2090 transitions. [2024-11-17 03:02:43,298 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2090 transitions. Word has length 46 [2024-11-17 03:02:43,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:43,298 INFO L471 AbstractCegarLoop]: Abstraction has 1848 states and 2090 transitions. [2024-11-17 03:02:43,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2090 transitions. [2024-11-17 03:02:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-17 03:02:43,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:43,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:02:43,309 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 03:02:43,502 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 03:02:43,503 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr856REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:43,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1413309484, now seen corresponding path program 1 times [2024-11-17 03:02:43,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:43,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534424715] [2024-11-17 03:02:43,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:43,504 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 03:02:43,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:43,507 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 03:02:43,509 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 03:02:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:43,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:02:43,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:43,957 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 03:02:43,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:02:43,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:43,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534424715] [2024-11-17 03:02:43,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534424715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:02:43,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:02:43,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:02:43,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136890291] [2024-11-17 03:02:43,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:02:43,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:02:43,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:43,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:02:43,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:02:43,959 INFO L87 Difference]: Start difference. First operand 1848 states and 2090 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:44,151 INFO L93 Difference]: Finished difference Result 2259 states and 2538 transitions. [2024-11-17 03:02:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:02:44,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-17 03:02:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:44,160 INFO L225 Difference]: With dead ends: 2259 [2024-11-17 03:02:44,160 INFO L226 Difference]: Without dead ends: 2259 [2024-11-17 03:02:44,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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 03:02:44,161 INFO L432 NwaCegarLoop]: 1821 mSDtfsCounter, 377 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 3503 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:44,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 3503 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:02:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2024-11-17 03:02:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1897. [2024-11-17 03:02:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1131 states have (on average 1.870026525198939) internal successors, (2115), 1887 states have internal predecessors, (2115), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 03:02:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2139 transitions. [2024-11-17 03:02:44,192 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2139 transitions. Word has length 54 [2024-11-17 03:02:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:44,194 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 2139 transitions. [2024-11-17 03:02:44,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:02:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2139 transitions. [2024-11-17 03:02:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-17 03:02:44,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:44,195 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] [2024-11-17 03:02:44,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-17 03:02:44,397 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 03:02:44,398 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr827REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:44,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:44,399 INFO L85 PathProgramCache]: Analyzing trace with hash -338938751, now seen corresponding path program 1 times [2024-11-17 03:02:44,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:44,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975747120] [2024-11-17 03:02:44,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:44,400 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 03:02:44,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:44,403 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 03:02:44,404 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 03:02:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:44,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 03:02:44,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:44,699 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 03:02:44,707 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 03:02:45,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:02:45,207 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 03:02:45,227 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 03:02:45,227 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 03:02:45,245 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 03:02:45,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:02:45,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:45,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975747120] [2024-11-17 03:02:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975747120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:02:45,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:02:45,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:02:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419413067] [2024-11-17 03:02:45,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:02:45,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:02:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:45,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:02:45,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:02:45,247 INFO L87 Difference]: Start difference. First operand 1897 states and 2139 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 03:02:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:47,544 INFO L93 Difference]: Finished difference Result 1813 states and 2055 transitions. [2024-11-17 03:02:47,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:02:47,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 57 [2024-11-17 03:02:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:47,551 INFO L225 Difference]: With dead ends: 1813 [2024-11-17 03:02:47,552 INFO L226 Difference]: Without dead ends: 1813 [2024-11-17 03:02:47,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 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 03:02:47,552 INFO L432 NwaCegarLoop]: 863 mSDtfsCounter, 1152 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:47,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1209 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-17 03:02:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-11-17 03:02:47,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1629. [2024-11-17 03:02:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 947 states have (on average 1.7888067581837381) internal successors, (1694), 1619 states have internal predecessors, (1694), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 03:02:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 1718 transitions. [2024-11-17 03:02:47,575 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 1718 transitions. Word has length 57 [2024-11-17 03:02:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:47,576 INFO L471 AbstractCegarLoop]: Abstraction has 1629 states and 1718 transitions. [2024-11-17 03:02:47,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 03:02:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 1718 transitions. [2024-11-17 03:02:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-17 03:02:47,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:47,578 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] [2024-11-17 03:02:47,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-17 03:02:47,778 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 03:02:47,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr820REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:47,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1844765473, now seen corresponding path program 1 times [2024-11-17 03:02:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:47,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747551790] [2024-11-17 03:02:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:47,780 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 03:02:47,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:47,784 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 03:02:47,785 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 03:02:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:48,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 03:02:48,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:48,036 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 03:02:48,050 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 03:02:48,075 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 03:02:48,084 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 03:02:48,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:02:48,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747551790] [2024-11-17 03:02:48,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747551790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:02:48,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:02:48,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:02:48,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535647602] [2024-11-17 03:02:48,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:02:48,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:02:48,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:48,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:02:48,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:02:48,086 INFO L87 Difference]: Start difference. First operand 1629 states and 1718 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 03:02:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:50,525 INFO L93 Difference]: Finished difference Result 1628 states and 1717 transitions. [2024-11-17 03:02:50,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:02:50,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 62 [2024-11-17 03:02:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:50,531 INFO L225 Difference]: With dead ends: 1628 [2024-11-17 03:02:50,531 INFO L226 Difference]: Without dead ends: 1628 [2024-11-17 03:02:50,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 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 03:02:50,532 INFO L432 NwaCegarLoop]: 1660 mSDtfsCounter, 2 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4303 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:50,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4303 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-17 03:02:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2024-11-17 03:02:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1628. [2024-11-17 03:02:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 947 states have (on average 1.787750791974657) internal successors, (1693), 1618 states have internal predecessors, (1693), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 03:02:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1717 transitions. [2024-11-17 03:02:50,551 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1717 transitions. Word has length 62 [2024-11-17 03:02:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:50,552 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 1717 transitions. [2024-11-17 03:02:50,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 03:02:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1717 transitions. [2024-11-17 03:02:50,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-17 03:02:50,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:50,553 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] [2024-11-17 03:02:50,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-17 03:02:50,753 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 03:02:50,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr821REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:50,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:50,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1844765472, now seen corresponding path program 1 times [2024-11-17 03:02:50,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:50,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349899324] [2024-11-17 03:02:50,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:50,755 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 03:02:50,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:50,758 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 03:02:50,759 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 03:02:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:51,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 03:02:51,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:51,018 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 03:02:51,036 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 03:02:51,045 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 03:02:51,094 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 03:02:51,113 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 03:02:51,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:02:51,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349899324] [2024-11-17 03:02:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349899324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:02:51,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:02:51,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:02:51,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957022391] [2024-11-17 03:02:51,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:02:51,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:02:51,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:51,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:02:51,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:02:51,117 INFO L87 Difference]: Start difference. First operand 1628 states and 1717 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 03:02:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:54,386 INFO L93 Difference]: Finished difference Result 1627 states and 1716 transitions. [2024-11-17 03:02:54,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:02:54,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 62 [2024-11-17 03:02:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:54,390 INFO L225 Difference]: With dead ends: 1627 [2024-11-17 03:02:54,391 INFO L226 Difference]: Without dead ends: 1627 [2024-11-17 03:02:54,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 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 03:02:54,391 INFO L432 NwaCegarLoop]: 1660 mSDtfsCounter, 1 mSDsluCounter, 2713 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4373 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:54,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4373 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-17 03:02:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-11-17 03:02:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1627. [2024-11-17 03:02:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 946 states have (on average 1.7885835095137421) internal successors, (1692), 1617 states have internal predecessors, (1692), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-17 03:02:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 1716 transitions. [2024-11-17 03:02:54,411 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 1716 transitions. Word has length 62 [2024-11-17 03:02:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:54,411 INFO L471 AbstractCegarLoop]: Abstraction has 1627 states and 1716 transitions. [2024-11-17 03:02:54,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 03:02:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 1716 transitions. [2024-11-17 03:02:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-17 03:02:54,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:54,412 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] [2024-11-17 03:02:54,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-17 03:02:54,613 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 03:02:54,613 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr816REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:54,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:54,613 INFO L85 PathProgramCache]: Analyzing trace with hash -494325732, now seen corresponding path program 1 times [2024-11-17 03:02:54,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:54,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766899095] [2024-11-17 03:02:54,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:54,614 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 03:02:54,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:54,616 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 03:02:54,617 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 03:02:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:54,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:02:54,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:54,915 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 03:02:54,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:02:54,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:54,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766899095] [2024-11-17 03:02:54,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766899095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:02:54,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:02:54,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:02:54,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632732135] [2024-11-17 03:02:54,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:02:54,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:02:54,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:54,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:02:54,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:02:54,919 INFO L87 Difference]: Start difference. First operand 1627 states and 1716 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 03:02:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:54,972 INFO L93 Difference]: Finished difference Result 1630 states and 1721 transitions. [2024-11-17 03:02:54,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:02:54,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 70 [2024-11-17 03:02:54,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:54,977 INFO L225 Difference]: With dead ends: 1630 [2024-11-17 03:02:54,978 INFO L226 Difference]: Without dead ends: 1630 [2024-11-17 03:02:54,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 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 03:02:54,978 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 0 mSDsluCounter, 3310 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4969 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 03:02:54,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4969 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:02:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2024-11-17 03:02:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1630. [2024-11-17 03:02:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 948 states have (on average 1.7879746835443038) internal successors, (1695), 1620 states have internal predecessors, (1695), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 03:02:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 1721 transitions. [2024-11-17 03:02:54,999 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 1721 transitions. Word has length 70 [2024-11-17 03:02:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:54,999 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 1721 transitions. [2024-11-17 03:02:55,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 03:02:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1721 transitions. [2024-11-17 03:02:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-17 03:02:55,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:55,000 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 03:02:55,010 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 03:02:55,201 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 03:02:55,201 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr816REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:55,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:55,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1049918698, now seen corresponding path program 1 times [2024-11-17 03:02:55,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:55,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564723507] [2024-11-17 03:02:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:02:55,202 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 03:02:55,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:55,204 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 03:02:55,204 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 03:02:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:02:55,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:02:55,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:55,508 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 03:02:55,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:02:55,578 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 03:02:55,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:55,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564723507] [2024-11-17 03:02:55,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564723507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:02:55,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:02:55,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 03:02:55,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091744953] [2024-11-17 03:02:55,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:02:55,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:02:55,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:55,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:02:55,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:02:55,583 INFO L87 Difference]: Start difference. First operand 1630 states and 1721 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 03:02:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:55,705 INFO L93 Difference]: Finished difference Result 1642 states and 1739 transitions. [2024-11-17 03:02:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:02:55,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2024-11-17 03:02:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:55,710 INFO L225 Difference]: With dead ends: 1642 [2024-11-17 03:02:55,710 INFO L226 Difference]: Without dead ends: 1642 [2024-11-17 03:02:55,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 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 03:02:55,711 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 6 mSDsluCounter, 3311 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4969 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:55,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4969 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:02:55,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2024-11-17 03:02:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1640. [2024-11-17 03:02:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 957 states have (on average 1.786833855799373) internal successors, (1710), 1629 states have internal predecessors, (1710), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 03:02:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 1736 transitions. [2024-11-17 03:02:55,733 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 1736 transitions. Word has length 71 [2024-11-17 03:02:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:55,733 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 1736 transitions. [2024-11-17 03:02:55,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 03:02:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1736 transitions. [2024-11-17 03:02:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-17 03:02:55,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:55,734 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] [2024-11-17 03:02:55,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-17 03:02:55,935 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 03:02:55,935 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr816REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:55,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:55,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1308418404, now seen corresponding path program 2 times [2024-11-17 03:02:55,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:55,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074890917] [2024-11-17 03:02:55,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:02:55,936 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 03:02:55,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:55,937 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 03:02:55,938 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 03:02:56,340 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 03:02:56,341 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:02:56,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 03:02:56,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:56,395 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 03:02:56,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:02:56,513 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 03:02:56,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:56,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074890917] [2024-11-17 03:02:56,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074890917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:02:56,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:02:56,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 03:02:56,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403972637] [2024-11-17 03:02:56,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:02:56,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 03:02:56,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:56,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 03:02:56,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 03:02:56,515 INFO L87 Difference]: Start difference. First operand 1640 states and 1736 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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 03:02:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:56,907 INFO L93 Difference]: Finished difference Result 1655 states and 1759 transitions. [2024-11-17 03:02:56,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 03:02:56,908 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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 74 [2024-11-17 03:02:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:56,913 INFO L225 Difference]: With dead ends: 1655 [2024-11-17 03:02:56,914 INFO L226 Difference]: Without dead ends: 1651 [2024-11-17 03:02:56,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 134 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 03:02:56,915 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 13 mSDsluCounter, 8274 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9932 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:56,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 9932 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:02:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2024-11-17 03:02:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1649. [2024-11-17 03:02:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 966 states have (on average 1.7826086956521738) internal successors, (1722), 1638 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 03:02:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 1748 transitions. [2024-11-17 03:02:56,949 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 1748 transitions. Word has length 74 [2024-11-17 03:02:56,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:56,949 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 1748 transitions. [2024-11-17 03:02:56,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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 03:02:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1748 transitions. [2024-11-17 03:02:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-17 03:02:56,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:56,951 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] [2024-11-17 03:02:56,960 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 (17)] Forceful destruction successful, exit code 0 [2024-11-17 03:02:57,151 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 03:02:57,152 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr816REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:02:57,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:57,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1502024612, now seen corresponding path program 3 times [2024-11-17 03:02:57,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:57,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642072299] [2024-11-17 03:02:57,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:02:57,153 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 03:02:57,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:57,154 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 03:02:57,156 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 03:02:57,796 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-17 03:02:57,796 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:02:57,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 03:02:57,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:57,918 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 03:02:57,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:02:58,363 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 03:02:58,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:58,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642072299] [2024-11-17 03:02:58,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642072299] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:02:58,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:02:58,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 03:02:58,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775154696] [2024-11-17 03:02:58,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:02:58,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 03:02:58,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:58,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 03:02:58,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 03:02:58,366 INFO L87 Difference]: Start difference. First operand 1649 states and 1748 transitions. Second operand has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 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 03:02:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:59,794 INFO L93 Difference]: Finished difference Result 1673 states and 1787 transitions. [2024-11-17 03:02:59,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 03:02:59,799 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 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 80 [2024-11-17 03:02:59,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:59,805 INFO L225 Difference]: With dead ends: 1673 [2024-11-17 03:02:59,805 INFO L226 Difference]: Without dead ends: 1667 [2024-11-17 03:02:59,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 03:02:59,807 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 17 mSDsluCounter, 19856 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 21515 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:59,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 21515 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 03:02:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-11-17 03:02:59,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2024-11-17 03:02:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 984 states have (on average 1.7733739837398375) internal successors, (1745), 1656 states have internal predecessors, (1745), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 03:02:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 1771 transitions. [2024-11-17 03:02:59,834 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 1771 transitions. Word has length 80 [2024-11-17 03:02:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:59,835 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 1771 transitions. [2024-11-17 03:02:59,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 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 03:02:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 1771 transitions. [2024-11-17 03:02:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-17 03:02:59,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:59,836 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] [2024-11-17 03:02:59,848 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 03:03:00,036 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 03:03:00,037 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr816REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:03:00,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:03:00,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1958516700, now seen corresponding path program 4 times [2024-11-17 03:03:00,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:03:00,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101396476] [2024-11-17 03:03:00,038 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 03:03:00,038 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 03:03:00,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:03:00,039 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 03:03:00,041 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 03:03:00,465 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 03:03:00,465 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:03:00,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 03:03:00,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:03:00,890 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 03:03:00,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:03:02,184 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 03:03:02,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:03:02,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101396476] [2024-11-17 03:03:02,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101396476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:03:02,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:03:02,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 03:03:02,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218906596] [2024-11-17 03:03:02,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:03:02,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 03:03:02,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:03:02,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 03:03:02,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 03:03:02,189 INFO L87 Difference]: Start difference. First operand 1667 states and 1771 transitions. Second operand has 50 states, 50 states have (on average 2.3) internal successors, (115), 50 states have internal predecessors, (115), 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 03:03:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:03:07,051 INFO L93 Difference]: Finished difference Result 1707 states and 1842 transitions. [2024-11-17 03:03:07,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 03:03:07,052 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.3) internal successors, (115), 50 states have internal predecessors, (115), 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 92 [2024-11-17 03:03:07,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:03:07,056 INFO L225 Difference]: With dead ends: 1707 [2024-11-17 03:03:07,056 INFO L226 Difference]: Without dead ends: 1701 [2024-11-17 03:03:07,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 03:03:07,058 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 44 mSDsluCounter, 39693 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 41352 SdHoareTripleChecker+Invalid, 2194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 03:03:07,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 41352 Invalid, 2194 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [87 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 03:03:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2024-11-17 03:03:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1701. [2024-11-17 03:03:07,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1018 states have (on average 1.7534381139489195) internal successors, (1785), 1690 states have internal predecessors, (1785), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-17 03:03:07,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 1811 transitions. [2024-11-17 03:03:07,078 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 1811 transitions. Word has length 92 [2024-11-17 03:03:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:03:07,079 INFO L471 AbstractCegarLoop]: Abstraction has 1701 states and 1811 transitions. [2024-11-17 03:03:07,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.3) internal successors, (115), 50 states have internal predecessors, (115), 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 03:03:07,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 1811 transitions. [2024-11-17 03:03:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-17 03:03:07,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:03:07,080 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] [2024-11-17 03:03:07,092 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 03:03:07,280 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 03:03:07,281 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr816REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-17 03:03:07,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:03:07,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1467240548, now seen corresponding path program 5 times [2024-11-17 03:03:07,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:03:07,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57739595] [2024-11-17 03:03:07,282 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 03:03:07,282 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 03:03:07,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:03:07,283 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 03:03:07,284 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 03:03:08,409 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-17 03:03:08,409 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:03:08,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-17 03:03:08,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:03:08,440 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 03:03:08,526 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-17 03:03:08,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-17 03:03:08,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 03:03:08,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-17 03:03:09,521 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:03:09,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-17 03:03:09,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-17 03:03:09,585 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 03:03:09,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:03:09,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:03:09,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57739595] [2024-11-17 03:03:09,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57739595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:03:09,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1549211108] [2024-11-17 03:03:09,884 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 03:03:09,884 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-17 03:03:09,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-17 03:03:09,885 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-17 03:03:09,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process